The MinMax k-Means clustering algorithm

Pattern Recognition

Volumn 47, Issue 7, 2014, Pages 2505-2516

  Tzortzis, Grigorios ^a   Likas, Aristidis ^a  

^a UNIVERSITY OF IOANNINA   (Greece)

Author keywords

Balanced clusters; Clustering; k Means; k Means initialization

Indexed keywords

CLUSTERING ALGORITHMS;

BALANCED CLUSTER; CLUSTERING APPROACH; CLUSTERINGS; INITIALIZATION PROBLEM; INTRA-CLUSTER; K-MEANS; K-MEANS CLUSTERING ALGORITHMS; K-MEANS INITIALIZATIONS; LOCAL OPTIMA; MIN-MAX;

ITERATIVE METHODS;

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

References (30)

1. R. Xu, and D.C. Wunsch II Survey of clustering algorithms IEEE Trans. Neural Netw. 16 3 2005 645 678
2. M. Filippone, F. Camastra, F. Masulli, and S. Rovetta A survey of kernel and spectral methods for clustering Pattern Recognit. 41 1 2008 176 190
3. S.P. Lloyd Least squares quantization in PCM IEEE Trans. Inf. Theory 28 2 1982 129 136
4. B. Schölkopf, A.J. Smola, and K.-R. Müller Nonlinear component analysis as a kernel eigenvalue problem Neural Comput. 10 5 1998 1299 1319
5. I.S. Dhillon, Y. Guan, B. Kulis, Kernel k-means, spectral clustering and normalized cuts, in: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004, pp. 551-556.
6. 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
7. M.E. Celebi, H.A. Kingravi, and P.A. Vela A comparative study of efficient initialization methods for the k-means clustering algorithm Expert Syst. Appl. 40 1 2013 200 210
8. D. Arthur, S. Vassilvitskii, k-Means++: the advantages of careful seeding, in: ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007, pp. 1027-1035.
9. C.-D. Wang, J.-H. Lai, J.-Y. Zhu, A conscience on-line learning approach for kernel-based clustering, in: International Conference on Data Mining (ICDM), 2010, pp. 531-540.
10. A. Banerjee, and J. Ghosh Frequency-sensitive competitive learning for scalable balanced clustering on high-dimensional hyperspheres IEEE Trans. Neural Netw. 15 3 2004 702 719
11. P.S. Bradley, U.M. Fayyad, Refining initial points for k-means clustering, in: International Conference on Machine Learning (ICML), 1998, pp. 91-99.
12. T. Su, and J.G. Dy In search of deterministic methods for initializing k-means and gaussian mixture clustering Intell. Data Anal. 11 4 2007 319 338
13. A. Likas, N.A. Vlassis, and J.J. Verbeek The global k-means clustering algorithm Pattern Recognit. 36 2 2003 451 461
14. A.M. Bagirov Modified global k-means for minimum sum-of-squares clustering problems Pattern Recognit. 41 10 2008 3192 3199
15. A.M. Bagirov, J. Ugon, and D. Webb Fast modified global k-means algorithm for incremental cluster construction Pattern Recognit. 44 4 2011 866 876
16. G. Tzortzis, A. Likas, The global kernel k-means clustering algorithm, in: International Joint Conference on Neural Networks (IJCNN), 2008, pp. 1977-1984.
17. G. Tzortzis, and A. Likas The global kernel k-means algorithm for clustering in feature space IEEE Trans. Neural Netw. 20 7 2009 1181 1194
18. H. Zha, X. He, C.H.Q. Ding, M. Gu, H.D. Simon, Spectral relaxation for k-means clustering, in: Advances in Neural Information Processing Systems (NIPS), 2001, pp. 1057-1064.
19. C.H.Q. Ding, X. He, K-means clustering via principal component analysis, in: International Conference on Machine Learning (ICML), 2004, pp. 225-232.
20. P.-N. Tan, M. Steinbach, and V. Kumar Introduction to Data Mining 2005 Addison-Wesley, Boston, MA, USA
21. J.Z. Huang, M.K. Ng, H. Rong, and Z. Li Automated variable weighting in k-means type clustering IEEE Trans. Pattern Anal. Mach. Intell. 27 5 2005 657 668
22. D.S. Modha, and W.S. Spangler Feature weighting in k-means clustering Mach. Learn. 52 3 2003 217 237
23. A. Keller, Fuzzy clustering with outliers, in: International Conference of the North American Fuzzy Information Processing Society (NAFIPS), 2000, pp. 143-147.
24. 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: International Conference on Data Mining (ICDM), 2001, pp. 107-114.
25. F. Nie, C.H.Q. Ding, D. Luo, H. Huang, Improved minmax cut graph clustering with nonnegative relaxation, in: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), 2010, pp. 451-466.
26. S.A. Nene, S.K. Nayar, H. Murase, Columbia Object Image Library (COIL-20), Technical Report CUCS-005-96 1996.
27. A. Kalogeratos, A. Likas, Dip-means: an incremental clustering method for estimating the number of clusters, in: Advances in Neural Information Processing Systems (NIPS), 2012, pp. 2402-2410.
28. D.G. Lowe Distinctive image features from scale-invariant keypoints Int. J. Comput. Vis. 60 2 2004 91 110
29. A. Frank, A. Asuncion, UCI machine learning repository, 2010. URL 〈 http://archive.ics.uci.edu/ml 〉.
30. B.J. Frey, and D. Dueck Clustering by passing messages between data points Science 315 2007 972 976 〈 www.psi.toronto.edu/affinitypropagation 〉