K-means*: Clustering by gradual data transformation

Pattern Recognition

Volumn 47, Issue 10, 2014, Pages 3376-3386

  Malinen, Mikko I ^a   Mariescu Istodor, Radu ^a   Fränti, Pasi ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

Clustering; Data transformation; K means

Indexed keywords

INVERSE TRANSFORMS; METADATA;

CLUSTERING; CLUSTERING MODEL; DATA TRANSFORMATION; EQUAL SIZES; K-MEANS; OPTIMAL CLUSTERING; PATHOLOGICAL DATA; TRADITIONAL APPROACHES;

STRUCTURAL OPTIMIZATION;

EID: 84902370672     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2014.03.034     Document Type: Article

References (23)

1. D. Aloise, A. Deshpande, P. Hansen, and P. Popat NP-hardness of Euclidean sum-of-squares clustering Mach. Learn. 75 2009 245 248
2. M. Inaba, N. Katoh, H. Imai, Applications of weighted voronoi diagrams and randomization to variance-based k-clustering, in: Proceedings of the 10th Annual ACM Symposium on Computational Geometry (SCG 1994), 1994, pp. 332-339.
3. J. MacQueen, Some methods of classification and analysis of multivariate observations, in: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, 1967, pp. 281-296.
4. D. Arthur, S. Vassilvitskii, How slow is the k-means method?, in: Proceedings of the 2006 Symposium on Computational Geometry (SoCG), 2006, pp. 144-153.
5. J.M. Peña, J.A. Lozano, and P. Larrañaga An empirical comparison of four initialization methods for the K-means algorithm Pattern Recognit. Lett. 20 10 1999 1027 1040
6. D. Steinley, and M.J. Brusco Initializing K-means batch clustering a critical evaluation of several techniques J. Class. 24 1 2007 99 121
7. D. Arthur, S. Vassilvitskii, k-means++: the advantages of careful seeding, in: SODA '07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2007, pp. 1027-1035.
8. D. MacKay, "Chapter 20. An Example Inference task: Clustering", in: Information Theory, Inference and Learning Algorithms, Cambridge University Press, Cambridge, 2003, pp. 284-292.
9. W.H. Equitz A new vector quantization clustering algorithm IEEE Trans. Acoust. Speech Signal Process. 37 1989 1568 1575
10. P. Fränti, O. Virmajoki, and V. Hautamäki Fast agglomerative clustering using a k-nearest neighbor graph IEEE Trans. Pattern Anal. Mach. Intell. 28 11 2006 1875 1881
11. P. Fränti, and O. Virmajoki Iterative shrinking method for clustering problems Pattern Recognit. 39 5 2006 761 765
12. P. Fränti, and J. Kivijärvi Randomized local search algorithm for the clustering problem Pattern Anal. Appl. 3 4 2000 358 369
13. D. Pelleg, A. Moore, X-means: extending k-means with efficient estimation of the number of clusters, in: Proceedings of the Seventeenth International Conference on Machine Learning, Morgan Kaufmann, San Francisco, 2000, pp. 727-734.
14. A. Likas, N. Vlassis, and J. Verbeek The global k-means clustering algorithm Pattern Recognit. 36 2003 451 461
15. A.P. Dempster, N.M. Laird, and D.B. Rubin Maximun likelihood from incomplete data via the EM algorithm J. R. Stat. Soc. B 39 1977 1 38
16. Q. Zhao, V. Hautamäki, I. Kärkkäinen, P. Fränti, Random swap EM algorithm for finite mixture models in image segmentation, in: 16th IEEE International Conference on Image Processing (ICIP), 2009, pp. 2397-2400.
17. C.H.Q. Ding, X. He, H. Zha, M. Gu, H.D. Simon, A min-max cut algorithm for graph partitioning and data clustering, in: Proceedings of IEEE International Conference on Data Mining (ICDM), 2001, pp. 107-114.
18. M.I. Malinen, and P. Fränti Clustering by analytic functions Inf. Sci. 217 0 2012 31 38
19. A. Ahmadi, F. Karray, and M.S. Kamel Model order selection for multiple cooperative swarms clustering using stability analysis Inf. Sci. 182 1 2012 169 183
20. C. Zhong, D. Miao, and P. Fränti Minimum spanning tree based split-and-merge a hierarchical clustering method Inf. Sci. 181 16 2011 3397 3410
21. L. Hubert, and P. Arabie Comparing partitions J. Class. 2 1 1985 193 218
22. S. van Dongen, Performance criteria for graph clustering and markov cluster experiments, Technical Report INSR0012, Centrum voor Wiskunde en Informatica, 2000.
23. N. Vinh, J. Epps, and J. Bailey Information theoretic measures for clusterings comparison variants, properties, normalization and correction for change J. Mach. Learn. Res. 11 2010 2837 2854