Minimum sum-of-squares clustering by DC programming and DCA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5755 LNAI, Issue , 2009, Pages 327-340

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

^a UNIVERSITÉ DE LORRAINE   (France)

^b UNIVERSITÉ ET INSA DE ROUEN   (France)

Author keywords

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

Indexed keywords

CLUSTERING; DC PROGRAMMING; DCA; EXACT PENALTY; MSSC; NONSMOOTH NONCONVEX PROGRAMMING;

CLUSTERING ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTER SCIENCE;

INTELLIGENT COMPUTING;

EID: 70350759411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04020-7_35     Document Type: Conference Paper

References (33)

1. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: Np-hardness of Euclidean Sumof-squares Clustering, Cahiers du GERAD, G-2008-33 (2008)
2. Arora, S., Kannan, R.: Learning Mixtures of Arbitrary Gaussians. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 247-257 (2001)
3. Bradley, B.S., Mangasarian, O.L.: Feature Selection via Concave Minimization and Support Vector Machines. In: Shavlik, J. (ed.) Machine Learning Proceedings of the Fifteenth International Conferences (ICML 1998), pp. 82-90. MorganKaufmann, San Francisco (1998)
4. Brusco, M.J.: A Repetitive Branch-and-bound Procedure for Minimum Withincluster Sum of Squares Partitioning. Psychometrika 71, 347-363 (2006)
5. Dhilon, I.S., Korgan, J., Nicholas, C.: Feature Selection and Document Clustering. In: Berry, M.W. (ed.) A Comprehensive Survey of Text Mining, pp. 73-100. Springer, Heidelberg (2003)
6. Duda, R.O., Hart, P.E.: Pattern classification and Scene Analysis. Wiley, Chichester (1972)
7. Feder, T., Greene, D.: Optimal Algorithms for Approximate Clustering. In: Proc. STOC (1988)
8. Fisher, D.: Knowledge Acquisition via Incremental Conceptual Clustering. Machine Learning 2, 139-172 (1987)
9. Forgy, E.: Cluster Analysis of Multivariate Date: Efficiency vs. Interpretability of Classifications. Biometrics, 21-768 (1965)
10. Jancey, R.C., Botany, J.: Multidimensional Group Analysis. Australian, 14-127 (1966)
11. Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: a Review. ACM Comput. Surv. 31(3), 264-323 (1999)
12. Krause, N., Singer, Y.: Leveraging the Margin More Carefully. In: International Conference on Machine Learning ICML (2004)
13. Le, T.H.A.: Contribution à l'optimisation non convexe et l'optimisation globale: Théorie, Algoritmes et Applications, Habilitation à Diriger des Recherches, Université de Rouen (1997)
14. Le, T.H.A., Pham, D.T.: Solving a Class of Linearly Constrained Indefinite Quadratic Problems by DC Algorithms. Journal of Global Optimization 11, 253-285 (1997)
15. Le, T.H.A., Pham, D.T.: The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems. Annals of Operations Research 133, 23-46 (2005)
16. Le, T.H.A., Pham, D.T., Huynh, V.: Ngai, Exact penalty in DC Programming, Technical Report. LMI, INSA-Rouen (2005)
17. Le, T.H.A., Belghiti, T., Pham, D.T.: A New Efficient Algorithm Based on DC Programming and DCA for Clustering. Journal of Global Optimization 37, 593-608 (2007)
18. Le, T.H.A., Le, H.M., Pham, D.T.: Optimization Based DC Programming and DCA for Hierarchical Clustering. European Journal of Operational Research (2006)
19. Le, T.H.A., Le, H.M., Nguyen, V.V., Pham, D.T.: A DC Programming Approach for Feature Selection in Support Vector Machines Learning. Journal of Advances in Data Analysis and Classification 2, 259-278 (2008)
20. Liu, Y., Shen, X., Doss, H.: Multicategory ψ-Learning and Support VectorMachine: Computational Tools. Journal of Computational and Graphical Statistics 14, 219-236 (2005)
21. Liu, Y., Shen, X.: Multicategoryψ -Learning. Journal of the American Statistical Association 101, 500-509 (2006)
22. Mangasarian, O.L.: Mathematical Programming in Data Mining. Data Mining and Knowledge Discovery 1, 183-201 (1997)
23. MacQueen, J.B.: Some Methods for Classification and Analysis of Multivariate Observations. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281-297. University of California Press, Berkeley (1967)
24. Merle, O.D., Hansen, P., Jaumard, B., Mladenovi'c, N.: An Interior Point Algorithm for Minimum Sum of Squares Clustering. SIAM J. Sci. Comput. 21, 1485-1505 (2000)
25. Neumann, J., Schnörr, C., Steidl, G.: SVM-based feature selection by direct objective minimisation. In: Rasmussen, C.E., Bülthoff, H.H., Schölkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol. 3175, pp. 212-219. Springer, Heidelberg (2004)
26. Peng, J., Xiay, Y.: A Cutting Algorithm for the Minimum Sum-of-Squared Error Clustering. In: Proceedings of the SIAM International Data Mining Conference (2005)
27. Pham, D.T., Le, T.H.A.: DC Optimization Algorithms for Solving the Trust Region Subproblem. SIAM J. Optimization 8, 476-505 (1998)
28. Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Mathematical Programming 79, 191-215 (1997)
29. Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)
30. Ronan, C., Fabian, S., Jason, W., Léon, B.: Trading Convexity for Scalability. In: International Conference on Machine Learning ICML (2006)
31. Shen, X., Tseng, G.C., Zhang, X., Wong, W.H.: ψ -Learning. Journal of American Statistical Association 98, 724-734 (2003)
32. Sherali, H.D., Desai, J.: A global Optimization RLT-based Approach for Solving the Hard Clustering Problem. Journal of Global Optimization 32, 281-306 (2005)
33. Yuille, A.L., Rangarajan, A.: The Convex Concave Procedure (CCCP). In: Advances in Neural Information Processing System, vol. 14. MIT Press, Cambrige (2002)