A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems

European Journal of Operational Research

Volumn 170, Issue 2, 2006, Pages 578-596

  Bagirov, Adil M ^a   Yearwood, John ^a  

^a UNIVERSITY OF BALLARAT   (Australia)

Author keywords

Cluster analysis; Minimum sum of squares clustering; Nonsmooth optimization

Indexed keywords

OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

CLUSTER ANALYSIS; MINIMUM SUM-OF-SQUARES CLUSTERING; NONSMOOTH OPTIMIZATION;

ALGORITHMS;

EID: 26844576391     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.06.014     Document Type: Article

References (39)

1. K.S. Al-Sultan A tabu search approach to the clustering problem Pattern Recognition 28 9 1995 1443 1451
2. K.S. Al-Sultan, and M.M. Khan Computational experience on four algorithms for the hard clustering problem Pattern Recognition Letters 17 1996 295 308
3. A.M. Bagirov Minimization methods for one class of nonsmooth functions and calculation of semi-equilibrium prices A. Eberhard Progress in Optimization: Contribution from Australasia 1999 Kluwer Academic Publishers 147 175
4. A.M. Bagirov A method for minimization of quasidifferentiable functions Optimization Methods and Software 17 1 2002 31 60
5. A.M. Bagirov, A.M. Rubinov, and J. Yearwood Using global optimization to improve classification for medical diagnosis and prognosis Topics in Health Information Management 22 2001 65 74
6. A.M. Bagirov, A.M. Rubinov, and J. Yearwood Global optimization approach to classification Optimization and Engineering 22 2001 65 74
7. H.H. Bock Automatische Klassifikation 1974 Vandenhoeck & Ruprecht Göttingen
8. H.H. Bock Clustering and neural networks A. Rizzi M. Vichi H.H. Bock Advances in Data Science and Classification 1998 Springer-Verlag Berlin 265 277
9. D.E. Brown, and C.L. Entail A practical application of simulated annealing to the clustering problem Pattern Recognition 25 1992 401 412
10. F.H. Clarke Optimization and Nonsmooth Analysis 1983 Wiley New York
11. V.F. Demyanov, and A.M. Rubinov Constructive Nonsmooth Analysis 1995 Peter Lang Frankfurt am Main
12. I.S. Dhillon, J. Fan, and Y. Guan Efficient clustering of very large document collections Data Mining for Scientific and Engineering Applications 2001 Kluwer Academic Publishers Dordrecht
13. G. Diehr Evaluation of a branch and bound algorithm for clustering SIAM J. Scientific and Statistical Computing 6 1985 268 284
14. R. Dubes, and A.K. Jain Clustering techniques: The user's dilemma Pattern Recognition 8 1976 247 260
15. O. du Merle, P. Hansen, B. Jaumard, and N. Mladenovic An interior point method for minimum sum-of-squares clustering SIAM Journal on Scientific Computing 21 2001 1485 1505
16. R.A. Fisher The use of multiple measurements in taxonomic problems Annals of Eugenics VII part II 1936 179 188 (Reprinted in: R.A. Fisher (Ed.), Contributions to Mathematical Statistics, Wiley, 1950)
17. P. Hanjoul, and D. Peeters A comparison of two dual-based procedures for solving the p-median problem European Journal of Operational Research 20 1985 387 396
18. P. Hansen, and B. Jaumard Cluster analysis and mathematical programming Mathematical Programming 79 1-3 1997 191 215
19. P. Hansen, and N. Mladenovic J-means: A new heuristic for minimum sum-of-squares clustering Pattern Recognition 4 2001 405 413
20. P. Hansen, and N. Mladenovic Variable neighborhood decomposition search Journal of Heuristic 7 2001 335 350
21. P. Hansen, E. Ngai, B.K. Cheung, N. Mladenovic, Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering, Research Paper G-2002-43, GERAD, Montreal, Canada, 2002.
22. J.-P. Hiriart-Urruty, and C. Lemarechal Convex Analysis and Minimization Algorithms vols. 1&2 1993 Springer-Verlag Berlin
23. D.M. Houkins, M.W. Muller, and J.A. ten Krooden Cluster analysis Topics in Applied Multivariate Analysis 1982 Cambridge University Press Cambridge
24. A.K. Jain, M.N. Murty, and P.J. Flynn Data clustering: A review ACM Computing Surveys 31 3 1999 264 323
25. R.E. Jensen A dynamic programming algorithm for cluster analysis Operations Research 17 1969 1034 1057
26. K.C. Kiwiel Methods of descent for nondifferentiable optimization Lecture Notes in Mathematics 1133 1985 Springer-Verlag Berlin
27. W.L.G. Koontz, P.M. Narendra, and K. Fukunaga A branch and bound clustering algorithm IEEE Transactions on Computers 24 1975 908 915
28. A. Likas, M. Vlassis, and J. Verbeek The global k-means clustering algorithm Pattern Recognition 36 2003 451 461
29. O.L. Mangasarian Mathematical programming in data mining Data Mining and Knowledge Discovery 1 1997 183 201
30. N. Mladenovic, and P. Hansen Variable neighborhood search Computer and Operations Research 24 1997 1097 1100
31. P.M. Murphy, D.W. Aha, UCI repository of machine learning databases, Technical report, Department of Information and Computer Science, University of California, Irvine, 1992. Available from: < http://www.ics.uci.edu/mlearn/ MLRepository.html>.
32. J.A. Nelder, and R. Mead A simplex method for function minimization Computer Journal 7 1965 308 313
33. M.J.D. Powell UOBYQA: Unconstrained optimization by quadratic approximation Mathematical Programming, Series B 92 3 2002 555 582
34. C.R. Reeves Modern Heuristic Techniques for Combinatorial Problems 1993 Blackwell London
35. G. Reinelt TSP-LIB-A Traveling salesman library ORSA Journal of Computation 3 1991 319 350
36. S.Z. Selim, and M.A. Ismail k-means-type algorithm: Generalized convergence theorem and characterization of local optimality IEEE Transactions on Pattern Analysis and Machine Intelligence 6 1984 81 87
37. S.Z. Selim, and K.S. Al-Sultan A simulated annealing algorithm for the clustering Pattern Recognition 24 10 1991 1003 1008
38. H. Spath Cluster Analysis Algorithms 1980 Ellis Horwood Limited Chichester
39. L.X. Sun, Y.L. Xie, X.H. Song, J.H. Wang, and R.Q. Yu Cluster analysis by simulated annealing Computers and Chemistry 18 1994 103 108