Modified global k-means algorithm for minimum sum-of-squares clustering problems

Pattern Recognition

Volumn 41, Issue 10, 2008, Pages 3192-3199

  Bagirov, Adil M ^a  

^a UNIVERSITY OF BALLARAT   (Australia)

Author keywords

Global k means algorithm; k Means algorithm; Minimum sum of squares clustering; Nonsmooth optimization

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CLASSIFICATION (OF INFORMATION); CLUSTER ANALYSIS; COMPUTATIONAL METHODS; EVOLUTIONARY ALGORITHMS; EXPERIMENTS; FLOW OF SOLIDS; FUNCTION EVALUATION; NUMERICAL METHODS; SCHEDULING ALGORITHMS; SET THEORY; TRANSIENTS;

CLUSTER CENTERS; CLUSTERING PROBLEMS; COMPUTATIONAL TIME; DATA POINTS; DATA SETS; ELSEVIER (CO); INCREMENTAL ALGORITHMS; K MEANS ALGORITHMS; LARGE DATA SETS; MINIMUM SUM-OF-SQUARES CLUSTERING; MODIFIED GLOBAL (MG); NEW ALGORITHM; NUMERICAL EXPERIMENTS; STARTING POINTS;

CLUSTERING ALGORITHMS;

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

References (23)

1. Bock H.H. Clustering and neural networks. In: Rizzi A., Vichi M., and Bock H.H. (Eds). Advances in Data Science and Classification (1998), Springer, Berlin 265-277
2. Spath H. Cluster Analysis Algorithms (1980), Ellis Horwood Limited, Chichester
3. Jain A.K., Murty M.N., and Flynn P.J. Data clustering: a review. ACM Comput. Surv. 31 3 (1999) 264-323
4. Al-Sultan K.S. A tabu search approach to the clustering problem. Pattern Recognition 28 9 (1995) 1443-1451
5. Brown D.E., and Entail C.L. A practical application of simulated annealing to the clustering problem. Pattern Recognition 25 (1992) 401-412
6. du Merle O., Hansen P., Jaumard B., and Mladenovic N. An interior point method for minimum sum-of-squares clustering. SIAM J. Sci. Comput. 21 (2001) 1485-1505
7. Diehr G. Evaluation of a branch and bound algorithm for clustering. SIAM J. Sci. Stat. Comput. 6 (1985) 268-284
8. Dubes R., and Jain A.K. Clustering techniques: the user's dilemma. Pattern Recognition 8 (1976) 247-260
9. Hanjoul P., and Peeters D. A comparison of two dual-based procedures for solving the p-median problem. Eur. J. Oper. Res. 20 (1985) 387-396
10. Hansen P., and Jaumard B. Cluster analysis and mathematical programming. Math. Programming 79 1-3 (1997) 191-215
11. Hansen P., and Mladenovic N. J-means: a new heuristic for minimum sum-of-squares clustering. Pattern Recognition 4 (2001) 405-413
12. Hansen P., and Mladenovic N. Variable neighborhood decomposition search. J. Heuristic 7 (2001) 335-350
13. Koontz W.L.G., Narendra P.M., and Fukunaga K. A branch and bound clustering algorithm. IEEE Trans. Comput. 24 (1975) 908-915
14. Selim S.Z., and Al-Sultan K.S. A simulated annealing algorithm for the clustering. Pattern Recognition 24 10 (1991) 1003-1008
15. Sun L.X., Xie Y.L., Song X.H., Wang J.H., and Yu R.Q. Cluster analysis by simulated annealing. Comput. Chem. 18 (1994) 103-108
16. Bagirov A.M., and Yearwood J. A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems. Eur. J. Oper. Res. 170 (2006) 578-596
17. Hansen P., Ngai E., Cheung B.K., and Mladenovic N. Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering. J. Classification 22 (2005) 287-310
18. Likas A., Vlassis M., and Verbeek J. The global k-means clustering algorithm. Pattern Recognition 36 (2003) 451-461
19. Bagirov A.M., Rubinov A.M., and Yearwood J. A global optimisation approach to classification. Optim. Eng. 3 2 (2002) 129-155
20. Bagirov A.M., Rubinov A.M., Soukhoroukova N.V., and Yearwood J. Supervised and unsupervised data classification via nonsmooth and global optimization. TOP: Span. Oper. Res. J. 11 1 (2003) 1-93
21. Fisher R.A. The use of multiple measurements in taxonomic problems. Ann. Eugen. VII part II (1936) 179-188 (Reprinted in: R.A. Fisher, Contributions to Mathematical Statistics, Wiley, 1950)
22. Reinelt G. TSP-LIB-a traveling salesman library. ORSA J. Comput. 3 (1991) 319-350
23. UCI repository of machine learning databases 〈http://www.ics.uci.edu/mlearn/MLRepository.html〉.