<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0120-1751</journal-id>
<journal-title><![CDATA[Revista Colombiana de Estadística]]></journal-title>
<abbrev-journal-title><![CDATA[Rev.Colomb.Estad.]]></abbrev-journal-title>
<issn>0120-1751</issn>
<publisher>
<publisher-name><![CDATA[Departamento de Estadística - Universidad Nacional de Colombia.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0120-17512010000200009</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Una revisión de los algoritmos de partición más comunes en el análisis de conglomerados: un estudio comparativo]]></article-title>
<article-title xml:lang="en"><![CDATA[A Review of the Most Common Partition Algorithms in Cluster Analysis: A Comparative Study]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[LEIVA-VALDEBENITO]]></surname>
<given-names><![CDATA[SUSANA A.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[TORRES-AVILÉS]]></surname>
<given-names><![CDATA[FRANCISCO J.]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad de Santiago de Chile Facultad de Ciencia Departamento de Matemática y Ciencia de la Computación]]></institution>
<addr-line><![CDATA[Santiago ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidad de Santiago de Chile Facultad de Ciencia Departamento de Matemática y Ciencia de la Computación]]></institution>
<addr-line><![CDATA[Santiago ]]></addr-line>
<country>Chile</country>
</aff>
<pub-date pub-type="pub">
<day>15</day>
<month>12</month>
<year>2010</year>
</pub-date>
<pub-date pub-type="epub">
<day>15</day>
<month>12</month>
<year>2010</year>
</pub-date>
<volume>33</volume>
<numero>2</numero>
<fpage>321</fpage>
<lpage>339</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0120-17512010000200009&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0120-17512010000200009&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0120-17512010000200009&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Este estudio está enfocado en comparar diversos métodos de partición del análisis de conglomerados, usualmente conocidos como métodos no jerárquicos. En este trabajo, se realizan estudios de simulación para comparar los resultados obtenidos al implementar los algoritmos k-medias, k-medianas, PAM y Clara cuando los datos son multivariados y de tipo continuo. Adicionalmente, se efectúa un estudio de simulación con el fin de comparar algoritmos de partición para datos cualitativos, confrontando la eficiencia de los algoritmos PAM y k-modas. La eficiencia de los algoritmos se compara usando el índice de Rand ajustado y la tasa de correcta clasificación. Finalmente, se aplican los algoritmos a bases de datos reales, las cuales poseen clases predefinidas.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[This study is oriented to compare several partition methods in the context of cluster analysis, which are also called non hierarchical methods. In this work, a simulation study is performed to compare the results obtained from the implementation of the algorithms k-means, k-medians, PAM and CLARA when continuous multivariate information is available. Additionally, a study of simulation is presented to compare partition algorithms qualitative information, comparing the efficiency of the PAM and k-modes algorithms. The efficiency of the algorithms is compared using the Adjusted Rand Index and the correct classification rate. Finally, the algorithms are applied to real databases with predefined classes.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[algoritmos de conglomerados]]></kwd>
<kwd lng="es"><![CDATA[medida de similaridad]]></kwd>
<kwd lng="es"><![CDATA[simulación]]></kwd>
<kwd lng="en"><![CDATA[Clustering algorithm]]></kwd>
<kwd lng="en"><![CDATA[Similarity measure]]></kwd>
<kwd lng="en"><![CDATA[Simulation]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  <font size="2" face="verdana">      <p> <b> <font size="4">     <center> Una revisi&oacute;n de los algoritmos de partici&oacute;n m&aacute;s comunes en el an&aacute;lisis de conglomerados: un estudio comparativo </center> </font> </b> </p>      <p> <b> <font size="3">     <center> A Review of the Most Common Partition Algorithms in Cluster Analysis: A Comparative Study </center> </font> </b> </p>      <p>     <center> SUSANA A. LEIVA-VALDEBENITO<sup>1</sup>,  FRANCISCO J. TORRES-AVIL&Eacute;S<sup>2</sup> </center> </p>      <p> <sup>1</sup>Universidad de Santiago de Chile, Facultad de Ciencia, Departamento de Matem&aacute;tica y Ciencia de la Computaci&oacute;n, Santiago, Chile. Estudiante de Ingenier&iacute;a Estad&iacute;stica. Email: <a href="mailto:susanaleivav@gmail.com">susanaleivav@gmail.com</a>     <br>  <sup>2</sup>Universidad de Santiago de Chile, Facultad de Ciencia, Departamento de Matem&aacute;tica y Ciencia de la Computaci&oacute;n, Santiago, Chile. Profesor asistente. Email: <a href="mailto:francisco.torres@usach.cl">francisco.torres@usach.cl</a>     <br> </p>  <hr size="1">      ]]></body>
<body><![CDATA[<p> <b>     <center> Resumen </center> </b> </p>      <p> Este estudio est&aacute; enfocado en comparar diversos m&eacute;todos de partici&oacute;n del an&aacute;lisis de conglomerados, usualmente conocidos como m&eacute;todos no jer&aacute;rquicos. En este trabajo, se realizan estudios de simulaci&oacute;n para comparar los resultados obtenidos al implementar los algoritmos k-medias, k-medianas, PAM y Clara cuando los datos son multivariados y de tipo continuo. Adicionalmente, se efect&uacute;a un estudio de simulaci&oacute;n con el fin de comparar algoritmos de partici&oacute;n para datos cualitativos, confrontando la eficiencia de los algoritmos PAM y k-modas. La eficiencia de los algoritmos se compara usando el &iacute;ndice de Rand ajustado y la tasa de correcta clasificaci&oacute;n. Finalmente, se aplican los algoritmos a bases de datos reales, las cuales poseen clases predefinidas. </p>      <p> <b> Palabras clave: </b> algoritmos de conglomerados, medida de similaridad, simulaci&oacute;n. </p>  <hr size="1">      <p> <b>     <center> Abstract </center> </b> </p>      <p> This study is oriented to compare several partition methods in the context of cluster analysis, which are also called non hierarchical methods. In this work, a simulation study is performed to compare the results obtained from the implementation of the algorithms k-means, k-medians, PAM and CLARA when continuous multivariate information is available. Additionally, a study of simulation is presented to compare partition algorithms qualitative information, comparing the efficiency of the PAM and k-modes algorithms. The efficiency of the algorithms is compared using the Adjusted Rand Index and the correct classification rate. Finally, the algorithms are applied to real databases with predefined classes. </p>      <p> <b> Key words: </b> Clustering algorithm, Similarity measure, Simulation. </p>  <hr size="1">      <p> Texto completo disponible en <a href="pdf/rce/v33n2/v33n2a09.pdf">PDF</a> </p>  <hr size="1">      <p> <b> <font size="3"> Referencias </font> </b> </p>       ]]></body>
<body><![CDATA[<!-- ref --><p> 1. Anderberg, M. (1973), <i>Cluster Analysis for Applications</i>, Academic Press, New York, United States. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000023&pid=S0120-1751201000020000900001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 2. Anderson, B., Gross, D., Musicant, D., Ritz, A., Smith, T. &amp; Steinberg, L. (2006), Adapting K-Medians to Generate Normalized Cluster Centers, 'Proceedings of the 2006 SIAM International Conference on Data Mining', Bethesda, p. 165-175. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000024&pid=S0120-1751201000020000900002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 3. Andreopoulos, B., An, A. &amp; Wang, X. (2006), Clustering Mixed Numerical and Low Quality Categorical Data: Significance Metrics on a Yeast Example, 'ACM SIGMOD Workshop on Information Quality in Information Systems, IQIS 2005 Statistics Clustering Session', Baltimore, p. 87-98. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000025&pid=S0120-1751201000020000900003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 4. Der, G. &amp; Everitt, B. S. (2006), <i>Statistical Analysis of Medical Data using SAS</i>, CRC Press, Boca Raton, United States. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000026&pid=S0120-1751201000020000900004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 5. Gower, J. C. (1971), 'A General Coefficient of Similarity and Some of its Properties', <i>Biometrics</i> <b>27</b>, 623-637. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000027&pid=S0120-1751201000020000900005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 6. Hae, P. &amp; Chi, J. (2009), 'A simple and Fast Algorithm for K-medoids Clustering', <i>Expert Systems with Applications</i> <b>36</b>, 3336-3341. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000028&pid=S0120-1751201000020000900006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 7. Han, J., Kamber, M. &amp; Tung, A. K. H. (2001), Spatial Clustering Methods in Data Mining: A Survey, 'Geographic Data Mining and Knowledge Discovery', Taylor &amp; Francis. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000029&pid=S0120-1751201000020000900007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 8. Hartigan, J. (1975), <i>Clustering Algorithms</i>, John Wiley &amp; Sons, Nueva York, United States. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000030&pid=S0120-1751201000020000900008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 9. He, Z., Deng, S. &amp; Xu, X. (2005), <i>Improving K-modes Algorithm Considering Frequencies of Attribute Values in Mode</i>, Vol. 3801 of <i>Lecture Notes in Computer Science</i>, Springer Berlin - Heidelberg, p. 157-162. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000031&pid=S0120-1751201000020000900009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 10. He, Z., Xu, X. &amp; Deng, S. (2007), 'Attribute Value Weighting in K-Modes Clustering', <i>Computer Science e-Prints</i> <b>1</b>, 1-15. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000032&pid=S0120-1751201000020000900010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 11. Huang, Z. (1998), 'Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values', <i>Data Mining and Knowledge Discovery</i> <b>2</b>, 283-304. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000033&pid=S0120-1751201000020000900011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 12. Hubert, L. &amp; Arabie, P. (1985), 'Comparing Partitions', <i>Journal of Classification</i> <b>2</b>, 193-218. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000034&pid=S0120-1751201000020000900012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 13. Kamber, M. &amp; Han, J. (2006), <i>Data Mining Concepts and Techniques</i>, Morgan Kaufman Publishers, San Francisco, United States. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000035&pid=S0120-1751201000020000900013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 14. Kaufman, L. &amp; Rousseeuw, P. (1987), Clustering by Means of Medoids, 'Statistical Data Analysis Based on the L<sub>1</sub> Norm and Related Methods', North-Holland, p. 405-416. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000036&pid=S0120-1751201000020000900014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 15. Kaufman, L. &amp; Rousseeuw, P. (1990), <i>Finding Groups in Data: An Introduction to Cluster Analysis</i>, John Wiley and Sons, New York, United States. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000037&pid=S0120-1751201000020000900015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 16. Leiva, S. (2008), Algoritmos de partici&oacute;n en el an&aacute;lisis de conglomerados: un estudio comparativo, Trabajo de Grado, Universidad de Santiago de Chile, Chile. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000038&pid=S0120-1751201000020000900016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 17. MacQueen, J. (1967), Some Methods for classification and Analysis of Multivariate Observations, 'Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability', Vol. 1, Symposium on mathematics, , , p. 281-297. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000039&pid=S0120-1751201000020000900017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 18. McGarigal, K., Cushman, S. &amp; Stafford, S. (2000), <i>Multivariate Statistics for Wildlife and Ecology Research</i>, Springer Verlag, New York, United States. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000040&pid=S0120-1751201000020000900018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 19. Ng, M. K., Li, M. J., Huang, J. Z. &amp; Zengyou, H. (2007), 'On the Impact of Dissimilarity Measure in k-Modes Clustering Algorithm', <i>, IEEE Transactions on Pattern Analysis and Machine Intelligence</i> <b>29</b>(3), 503-507. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000041&pid=S0120-1751201000020000900019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 20. Ng, R. &amp; Han, J. (1994), Efficient and Effective Clustering Methods for Spatial Data Mining, 'Proceeding of the 20<sup>t</sup>h International Conference on Very Large Databases', p. 144-155. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000042&pid=S0120-1751201000020000900020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 21. Pe&ntilde;a, D. (2002), <i>An&aacute;lisis de datos multivariantes</i>, McGraw-Hill, Madrid, Espa&ntilde;a. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000043&pid=S0120-1751201000020000900021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 22. Quinn, G. &amp; Keough, M. (2002), <i>Experimental Design and Data Analysis for Biologists</i>, Cambridge University Press, Cambridge, UK. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000044&pid=S0120-1751201000020000900022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 23. R Development Core Team, (2010), <i>R: A Language and Environment for Statistical Computing</i>, R Foundation for Statistical Computing, Vienna, Austria. ISBN 3-900051-07-0. *<a href="http://www.R-project.org" target="_blank">http://www.R-project.org</a> &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000045&pid=S0120-1751201000020000900023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 24. SAS Institute Inc., (2008), <i>SAS/STAT 9.2 User&#39;s Guide</i>, SAS Publishing, Cary, Carolina del Norte. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000046&pid=S0120-1751201000020000900024&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p> 25. Velmurugan, T. &amp; Santhanam, T. (2010), 'Computational Complexity between K-Means and K-Medoids Clustering Algorithms for Normal and Uniform Distributions of Data Points', <i>Journal of Computer Science</i> <b>6</b>(3), 363-368. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000047&pid=S0120-1751201000020000900025&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><center> <b>&#91;Recibido en mayo de 2010. Aceptado en octubre de 2010&#93;</b> </center> <hr size="1">      <p> Este art&iacute;culo se puede citar en <i>LaTeX</i> utilizando la siguiente referencia bibliogr&aacute;fica de <i>BibTeX</i>: </p> <code><font size="2">@ARTICLE{RCEv33n2a09,    <br>  &nbsp;&nbsp;&nbsp; AUTHOR &nbsp;= {Leiva-Valdebenito, Susana A. and Torres-Avil&eacute;s, Francisco J.},    <br>  &nbsp;&nbsp;&nbsp; TITLE &nbsp; = {{Una revisi&oacute;n de los algoritmos de partici&oacute;n m&aacute;s comunes en el an&aacute;lisis de conglomerados: un estudio comparativo}},    <br>  &nbsp;&nbsp;&nbsp; JOURNAL = {Revista Colombiana de Estad&iacute;stica},    ]]></body>
<body><![CDATA[<br> &nbsp;&nbsp;&nbsp; YEAR &nbsp;&nbsp; = {2010},    <br> &nbsp;&nbsp;&nbsp; volume &nbsp;= {33},    <br> &nbsp;&nbsp;&nbsp; number &nbsp;= {2},    <br> &nbsp;&nbsp;&nbsp; pages &nbsp; = {321-339}    <br> }</font></code>  <hr size="1"> </font>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Anderberg]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Cluster Analysis for Applications]]></source>
<year>1973</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Academic Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Anderson]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Gross]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Musicant]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Ritz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Steinberg]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Adapting K-Medians to Generate Normalized Cluster Centers]]></article-title>
<source><![CDATA['Proceedings of the 2006 SIAM International Conference on Data Mining']]></source>
<year>2006</year>
<page-range>165-175</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Andreopoulos]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[An]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Clustering Mixed Numerical and Low Quality Categorical Data: Significance Metrics on a Yeast Example]]></article-title>
<source><![CDATA['ACM SIGMOD Workshop on Information Quality in Information Systems, IQIS 2005 Statistics Clustering Session']]></source>
<year>2006</year>
<page-range>87-98</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Der]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Everitt]]></surname>
<given-names><![CDATA[B. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Statistical Analysis of Medical Data using SAS]]></source>
<year>2006</year>
<publisher-loc><![CDATA[Boca Raton ]]></publisher-loc>
<publisher-name><![CDATA[CRC Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gower]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA['A General Coefficient of Similarity and Some of its Properties']]></article-title>
<source><![CDATA[Biometrics]]></source>
<year>1971</year>
<volume>27</volume>
<page-range>623-637</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hae]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Chi]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA['A simple and Fast Algorithm for K-medoids Clustering']]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2009</year>
<volume>36</volume>
<page-range>3336-3341</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Kamber]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Tung]]></surname>
<given-names><![CDATA[A. K. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Spatial Clustering Methods in Data Mining: A Survey]]></article-title>
<source><![CDATA['Geographic Data Mining and Knowledge Discovery']]></source>
<year>2001</year>
<publisher-name><![CDATA[Taylor & Francis]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hartigan]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Clustering Algorithms]]></source>
<year>1975</year>
<publisher-loc><![CDATA[Nueva York ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley & Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[He]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[Improving K-modes Algorithm Considering Frequencies of Attribute Values in Mode]]></source>
<year>2005</year>
<volume>3801</volume>
<page-range>157-162</page-range><publisher-name><![CDATA[Springer Berlin - Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[He]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA['Attribute Value Weighting in K-Modes Clustering']]></article-title>
<source><![CDATA[Computer Science e-Prints]]></source>
<year>2007</year>
<volume>1</volume>
<page-range>1-15</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA['Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values']]></article-title>
<source><![CDATA[Data Mining and Knowledge Discovery]]></source>
<year>1998</year>
<volume>2</volume>
<page-range>283-304</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hubert]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Arabie]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA['Comparing Partitions']]></article-title>
<source><![CDATA[Journal of Classification]]></source>
<year>1985</year>
<volume>2</volume>
<page-range>193-218</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kamber]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Data Mining Concepts and Techniques]]></source>
<year>2006</year>
<publisher-loc><![CDATA[San Francisco ]]></publisher-loc>
<publisher-name><![CDATA[Morgan Kaufman Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaufman]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Rousseeuw]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Clustering by Means of Medoids]]></article-title>
<source><![CDATA['Statistical Data Analysis Based on the L1 Norm and Related Methods']]></source>
<year>1987</year>
<page-range>405-416</page-range><publisher-name><![CDATA[North-Holland]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaufman]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Rousseeuw]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Finding Groups in Data: An Introduction to Cluster Analysis]]></source>
<year>1990</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley and Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leiva]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algoritmos de partición en el análisis de conglomerados: un estudio comparativo]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[MacQueen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Some Methods for classification and Analysis of Multivariate Observations]]></article-title>
<source><![CDATA['Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability']]></source>
<year>1967</year>
<volume>1</volume>
<page-range>281-297</page-range><publisher-name><![CDATA[Symposium on mathematics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[McGarigal]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Cushman]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Stafford]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Multivariate Statistics for Wildlife and Ecology Research]]></source>
<year>2000</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ng]]></surname>
<given-names><![CDATA[M. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[M. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[J. Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Zengyou]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA['On the Impact of Dissimilarity Measure in k-Modes Clustering Algorithm']]></article-title>
<source><![CDATA[, IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>2007</year>
<volume>29</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>503-507</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ng]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Efficient and Effective Clustering Methods for Spatial Data Mining]]></article-title>
<source><![CDATA['Proceeding of the 20t h International Conference on Very Large Databases']]></source>
<year>1994</year>
<page-range>144-155</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Peña]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Análisis de datos multivariantes]]></source>
<year>2002</year>
<publisher-loc><![CDATA[Madrid ]]></publisher-loc>
<publisher-name><![CDATA[McGraw-Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Quinn]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Keough]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Experimental Design and Data Analysis for Biologists]]></source>
<year>2002</year>
<publisher-loc><![CDATA[Cambridge ]]></publisher-loc>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="book">
<collab>R Development Core Team,</collab>
<source><![CDATA[R: A Language and Environment for Statistical Computing]]></source>
<year>2010</year>
<publisher-loc><![CDATA[Vienna ]]></publisher-loc>
<publisher-name><![CDATA[R Foundation for Statistical Computing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SAS Institute Inc.]]></surname>
</name>
</person-group>
<source><![CDATA[SAS/STAT 9.2 User&#39;s Guide]]></source>
<year>2008</year>
<publisher-loc><![CDATA[Cary ]]></publisher-loc>
<publisher-name><![CDATA[SAS Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Velmurugan]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Santhanam]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA['Computational Complexity between K-Means and K-Medoids Clustering Algorithms for Normal and Uniform Distributions of Data Points']]></article-title>
<source><![CDATA[Journal of Computer Science]]></source>
<year>2010</year>
<volume>6</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>363-368</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
