| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000560655 |
| ISSN: | 1405-5546 |
| Autores: | Almanza Ortega, Nelva Nely1 Pérez Ortega, Joaquín2 Zavala Díaz, José Crispín3 Solís Romero, José1 |
| Instituciones: | 1Tecnológico Nacional de México, División de Estudios de Posgrado e Investigación, Ciudad de México. México 2Tecnológico Nacional de México, Departamento de Ciencias Computacionales, Ciudad de México. México 3Universidad Autónoma del Estado de México, Facultad de Contaduría Administración e Informática, Estado de México. México |
| Año: | 2022 |
| Periodo: | Ene-Mar |
| Volumen: | 26 |
| Número: | 1 |
| Paginación: | 125-133 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Resumen en inglés | One of the ways of acquiring new knowledge or underlying patterns in data is by means of clustering algorithms or techniques for creating groups of objects or individuals with similar characteristics in each group and at the same time different from the other groups. There is a consensus in the scientific community that the most widely used clustering algorithm is K-means, mainly because its results are easy to interpret and there are different implementations. In this paper we present an exploratory analysis of the behavior of the main variants of the K-means algorithm (Hartigan-Wong, Lloyd, Forgy and MacQueen) when solving some of the difficult sets of instances from the Fundamental Clustering Problems Suite (FCPS) benchmark. These variants are implemented in the R language and allow finding the minimum and maximum intra-cluster distance of the final clustering. The different scenarios are shown with the results obtained. |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Procesamiento de datos |
| Keyword: | Data processing |
| Texto completo: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
