An efficient approximation to the K-means clustering for Massive Data
Due to the progressive growth of the amount of data available in a wide variety of scientific fields, it has become more difficult to manipulate and analyze such information. In spite of its dependency on the initial settings and the large number of distance computations that it can require to conve...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2016 |
| País: | España |
| Recursos: | Basque Center for Applied Mathematics (BCAM) |
| Repositorio: | BIRD. BCAM's Institutional Repository Data |
| OAI Identifier: | oai:bird.bcamath.org:20.500.11824/289 |
| Acesso em linha: | http://hdl.handle.net/20.500.11824/289 |
| Access Level: | acceso abierto |
| Palavra-chave: | K-means clustering K-means++ minibatch K-means |
| Resumo: | Due to the progressive growth of the amount of data available in a wide variety of scientific fields, it has become more difficult to manipulate and analyze such information. In spite of its dependency on the initial settings and the large number of distance computations that it can require to converge, the $K$-means algorithm remains as one of the most popular clustering methods for massive datasets. In this work, we propose an efficient approximation to the $K$-means problem intended for massive data. Our approach recursively partitions the entire dataset into a small number of subsets, each of which is characterized by its representative (center of mass) and weight (cardinality), afterwards a weighted version of the $K$-means algorithm is applied over such local representation, which can drastically reduce the number of distances computed. In addition to some theoretical properties, experimental results indicate that our method outperforms well-known approaches, such as the $K$-means++ and the minibatch $K$-means, in terms of the relation between number of distance computations and the quality of the approximation. |
|---|