New and efficient DCA based algorithms for minimum sum-of-squares clustering

Pattern Recognition

Volumn 47, Issue 1, 2014, Pages 388-401

  Hoai An, Le Thi ^a   Hoai Minh, Le ^a   Tao, Pham Dinh ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b Avenue de l Université 76801 Saint Etienne du Rouvray   (France)

Author keywords

Clustering; Combinatorial optimization; DC programming; DCA; Exact penalty; Gaussian kernel; MSSC; Nonsmooth nonconvex programming

Indexed keywords

CLUSTERING; D-C PROGRAMMING; DCA; EXACT PENALTY; GAUSSIAN KERNELS; MSSC; NON-CONVEX PROGRAMMING;

COMBINATORIAL OPTIMIZATION; FUNCTIONS; INTEGER PROGRAMMING; ITERATIVE METHODS; NUMERICAL METHODS;

CLUSTERING ALGORITHMS;

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

References (51)

1. M. Aizerman, E. Braverman, and L. Rozonoer Theoretical foundations of the potential function method in pattern recognition learning Automation and Remote Control 25 1964 821
2. D. Aloise, A. Deshpande, P. Hansen, P. Popat, Np-Hardness of Euclidean Sum-of-Squares Clustering, Cahiers du GERAD G-2008-33, 2008.
3. S. Arora, R. Kannan, Learning mixtures of arbitrary Gaussians, in: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 247-257. (Pubitemid 32865740)
4. A.M. Bagirov Modified global k-means algorithm for minimum sum-of-squares clustering problems Pattern Recognition 41 10 2008 3192 3199
5. Bharath K. Sriperumbudur, David A. Torres, Gert R.G. Lanckriet, Sparse eigen methods by D.C. programming, in: Proceedings of the 25th International Conference on Machine Learning, 2007.
6. B.S. Bradley, O.L. Mangasarian, Feature selection via concave minimization and support vector machines, in: Machine Learning Proceedings of the 15th International Conferences (ICML'98), San Francisco, CA, Morgan Kaufmann, 1998, pp. 82-90.
7. J.C. Bezdek, Fuzzy Mathematics in Pattern Classification, Ph.D. Dissertation, Cornell University, Ithaca, NY, 1973.
8. M.J. Brusco A repetitive branch-and-bound procedure for minimum within-cluster sum of squares partitioning Psychometrika 71 2006 347 363 (Pubitemid 44121183)
9. C. Cortes, and V. Vapnik Support vector networks Machine Learning 20 1995 273 297
10. A.P. Dempster, N.M. Laird, and D.B. Rubin Maximum likelihood from incomplete data via the EM algorithm Journal of the Royal Statistical Society: Series B 39 1977 1 38
11. I.S. Dhilon, J. Korgan, and C. Nicholas Feature selection and document clustering M.W. Berry, A Comprehensive Survey of Text Mining 2003 Springer-Verlag 73 100
12. D. Fisher Knowledge acquisition via incremental conceptual clustering Machine Learning 2 1987 139 172
13. R.O. Duda, and P.E. Hart Pattern Classification and Scene Analysis 1972 Wiley
14. T. Feder, D. Greene, Optimal algorithms for approximate clustering, in: Proceedings of STOC, 1988.
15. M. Filippone, F. Camastra, F. Masulli, and S. Rovetta A survey of kernel and spectral methods for clustering Pattern Recognition 41 2008 176 190 (Pubitemid 47284212)
16. E. Forgy Cluster analysis of multivariate date efficiency vs. interpretability of classifications Biometrics 21 1965 768
17. R.C. Jancey Multidimensional group analysis Australian Journal of Botany 14 1996 127 130
18. A.K. Jain, M.N. Murty, and P.J. Flynn Data clustering a review ACM Computing Surveys 31 3 1999 264 323
19. J.J. Joaquim, M. Raydan, S.S. Rosa, and S.A. Santos On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm Numerical Algorithms 47 4 2008 391 407
20. P. Hansen, and B. Jaumard Cluster analysis and mathematical programming Mathematical Programming 79 1997 191 215 (Pubitemid 127397727)
21. Herbrich Learning Kernel Classifiers 2002 MIT Press
22. N. Krause, Y. Singer, Leveraging the margin more carefully, in: International Conference on Machine Learning, ICML, 2004.
23. Le Thi Hoai An, Contribution à l'optimisation non convexe et l'optimisation globale: Théorie, Algoritmes et Applications, Habilitation à Diriger des Recherches, Université de Rouen, 1997.
24. Le Thi Hoai An, DC Programming and DCA, http://lita.sciences.univ-metz. fr/~lethi .
25. Le Thi Hoai An, and Pham Dinh Tao Solving a class of linearly constrained indefinite quadratic problems by DC algorithms Journal of Global Optimization 11 3 1997 253 285 (Pubitemid 127502332)
26. Le Thi Hoai An, and Pham Dinh Tao A branch-and-bound method via D.C. optimization algorithm and ellipsoidal technique for box constrained nonconvex quadratic programming problems Journal of Global Optimization 13 1998 171 206
27. Le Thi Hoai An, and Pham Dinh Tao The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems Annals of Operations Research 133 2005 23 46 (Pubitemid 40389738)
28. Le Thi Hoai An, Huynh Van Ngai, Pham Dinh Tao, Exact penalty and error bounds in DC programming, Journal of Global Optimization, dedicated to Reiner Horst, 52 (3) (2012) 509-535
29. Le Thi Hoai An, Le Hoai Minh, and Pham Dinh Tao Optimization based DC programming and DCA for hierarchical clustering European Journal of Operational Research 183 2006 1067 1085
30. Le Thi Hoai An, T. Belghiti, and Pham Dinh Tao A new efficient algorithm based on DC programming and DCA for Clustering Journal of Global Optimization 37 2007 593 608 (Pubitemid 46327445)
31. Le Thi Hoai An, Le Hoai Minh, and Pham Dinh Tao Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms Journal of Advances in Data Analysis and Classification 2 2007 1 20
32. Le Thi Hoai An, Le Hoai Minh, Nguyen Van Vinh, and Pham Dinh Tao A DC programming approach for feature selection in support vector machines learning Journal of Advances in Data Analysis and Classification 2 3 2008 259 278
33. Le Thi Hoai An, Pham Dinh Tao, Minimum sum-of-squares clustering by DC programming and DCA, in: ICIC'09 Proceedings of the Intelligent Computing 5th International Conference on Emerging Intelligent Computing Technology and Applications, 2009, pp. 327-340.
34. Le Thi Hoai An, Le Hoai Minh, Pham Dinh Tao, and Huynh Van Ngai Binary classification via spherical separator by DC programming and DCA Journal of Global Optimization 23 2012 1 15 10.1007/s10898-012-9859-6
35. Le Thi Hoai An, Le Hoai Minh, Pham Dinh Tao, Huynh Van Ngai, Block clustering based on DC programming and DCA, Neural Computation, http://dx.doi.org/10. 1162/NECO-a-00490, in press.
36. Le Thi Hoai An, Pham Dinh Tao, Nguyen Canh Nam, Le Hoai Minh, DC programming and DCA for diversity data mining, Optimisation, in press.
37. Y. Liu, X. Shen, and H. Doss Multicategory ψ-learning and support vector machine, computational tools Journal of Computational and Graphical Statistics 14 2005 219 236 (Pubitemid 40447834)
38. Y. Liu, and X. Shen Multicategory ψ-learning Journal of the American Statistical Association 101 2006 500 509
39. O.L. Mangasarian Mathematical programming in data mining Data Mining and Knowledge Discovery 1 1997 183 201 (Pubitemid 127721240)
40. J.B. MacQueen, Some methods for classification and analysis of multivariate observations, in: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, Berkeley, University of California Press, 1967, pp. 281-297.
41. O. Du Merle, P. Hansen, B. Jaumard, and N. Mladenovi'c An interior point algorithm for minimum sum of squares clustering SIAM Journal on Scientific Computing 21 4 2000 1485 1505
42. N. Mladenović, and P. Hansen Variable neighborhood search Computers & Operations Research 24 1997 1097 1100
43. J. Neumann, C. Schnörr, G. Steidl, SVM-based feature selection by direct objective minimisation, pattern recognition, in: Proceedings of 26th DAGM Symposium, 2004, pp. 212-219.
44. J. Peng, Y. Xiay, A cutting algorithm for the minimum sum-of-squared error clustering, in: Proceedings of the SIAM International Data Mining Conference, 2005.
45. Pham Dinh Tao, and Le Thi Hoai An DC optimization algorithms for solving the trust region subproblem SIAM Journal of Optimization 8 1998 476 505 (Pubitemid 128337851)
46. C. Ronan, S. Fabian, W. Jason, B. Léon, Trading convexity for scalability, in: International Conference on Machine Learning ICML, 2006.
47. X. Shen, G.C. Tseng, X. Zhang, and W.H. Wong ψ-learning Journal of American Statistical Association 98 2003 724 734
48. A.E. Xavier, and V.L. Xavier Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions Pattern Recognition 44 2011 70 77
49. H.D. Sherali, and J. Desai A global optimization RLT-based approach for solving the hard clustering problem Journal of Global Optimization 32 2005 281 306 (Pubitemid 41367549)
50. A.L. Yuille, A. Rangarajan, The convex concave procedure (CCCP), in: Advances in Neural Information Processing System, MIT Press, Cambridge MA, 2002, p. 14.
51. H.D. Vinod Integer programming and the theory of grouping Journal of the American Statistical Association 64 1969 506 519