{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T02:35:51Z","timestamp":1773455751446,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642040191","type":"print"},{"value":"9783642040207","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04020-7_35","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T18:43:19Z","timestamp":1252953799000},"page":"327-340","source":"Crossref","is-referenced-by-count":6,"title":["Minimum Sum-of-Squares Clustering by DC Programming and DCA"],"prefix":"10.1007","author":[{"given":"Le Thi","family":"Hoai An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pham Dinh","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: Np-hardness of Euclidean Sum-of-squares Clustering, Cahiers du GERAD, G-2008-33 (2008)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Kannan, R.: Learning Mixtures of Arbitrary Gaussians. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 247\u2013257 (2001)","DOI":"10.1145\/380752.380808"},{"key":"35_CR3","first-page":"82","volume-title":"Machine Learning Proceedings of the Fifteenth International Conferences (ICML 1998)","author":"B.S. Bradley","year":"1998","unstructured":"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\u201390. MorganKaufmann, San Francisco (1998)"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11336-004-1218-1","volume":"71","author":"M.J. Brusco","year":"2006","unstructured":"Brusco, M.J.: A Repetitive Branch-and-bound Procedure for Minimum Within-cluster Sum of Squares Partitioning. Psychometrika\u00a071, 347\u2013363 (2006)","journal-title":"Psychometrika"},{"key":"35_CR5","first-page":"73","volume-title":"A Comprehensive Survey of Text Mining","author":"I.S. Dhilon","year":"2003","unstructured":"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\u2013100. Springer, Heidelberg (2003)"},{"key":"35_CR6","volume-title":"Pattern classification and Scene Analysis","author":"R.O. Duda","year":"1972","unstructured":"Duda, R.O., Hart, P.E.: Pattern classification and Scene Analysis. Wiley, Chichester (1972)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal Algorithms for Approximate Clustering. In: Proc. STOC (1988)","DOI":"10.1145\/62212.62255"},{"key":"35_CR8","first-page":"139","volume":"2","author":"D. Fisher","year":"1987","unstructured":"Fisher, D.: Knowledge Acquisition via Incremental Conceptual Clustering. Machine Learning\u00a02, 139\u2013172 (1987)","journal-title":"Machine Learning"},{"key":"35_CR9","unstructured":"Forgy, E.: Cluster Analysis of Multivariate Date: Efficiency vs. Interpretability of Classifications. Biometrics, 21\u2013768 (1965)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Jancey, R.C., Botany, J.: Multidimensional Group Analysis. Australian, 14\u2013127 (1966)","DOI":"10.1071\/BT9660127"},{"issue":"3","key":"35_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: a Review. ACM Comput. Surv.\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Krause, N., Singer, Y.: Leveraging the Margin More Carefully. In: International Conference on Machine Learning ICML (2004)","DOI":"10.1145\/1015330.1015344"},{"key":"35_CR13","unstructured":"Le, T.H.A.: Contribution \u00e0 l\u2019optimisation non convexe et l\u2019optimisation globale: Th\u00e9orie, Algoritmes et Applications, Habilitation \u00e0 Diriger des Recherches, Universit\u00e9 de Rouen (1997)"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"T.H.A. Le","year":"1997","unstructured":"Le, T.H.A., Pham, D.T.: Solving a Class of Linearly Constrained Indefinite Quadratic Problems by DC Algorithms. Journal of Global Optimization\u00a011, 253\u2013285 (1997)","journal-title":"Journal of Global Optimization"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"T.H.A. Le","year":"2005","unstructured":"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\u00a0133, 23\u201346 (2005)","journal-title":"Annals of Operations Research"},{"key":"35_CR16","unstructured":"Le, T.H.A., Pham, D.T., Huynh, V.: Ngai, Exact penalty in DC Programming, Technical Report. LMI, INSA-Rouen (2005)"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10898-006-9066-4","volume":"37","author":"T.H.A. Le","year":"2007","unstructured":"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\u00a037, 593\u2013608 (2007)","journal-title":"Journal of Global Optimization"},{"key":"35_CR18","unstructured":"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)"},{"key":"35_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"T.H.A. Le","year":"2008","unstructured":"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\u00a02, 259\u2013278 (2008)","journal-title":"Journal of Advances in Data Analysis and Classification"},{"key":"35_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1198\/106186005X37238","volume":"14","author":"Y. Liu","year":"2005","unstructured":"Liu, Y., Shen, X., Doss, H.: Multicategory \u03c8-Learning and Support Vector Machine: Computational Tools. Journal of Computational and Graphical Statistics\u00a014, 219\u2013236 (2005)","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"35_CR21","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1198\/016214505000000781","volume":"101","author":"Y. Liu","year":"2006","unstructured":"Liu, Y., Shen, X.: Multicategory\u03c8 -Learning. Journal of the American Statistical Association\u00a0101, 500\u2013509 (2006)","journal-title":"Journal of the American Statistical Association"},{"key":"35_CR22","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1009735908398","volume":"1","author":"O.L. Mangasarian","year":"1997","unstructured":"Mangasarian, O.L.: Mathematical Programming in Data Mining. Data Mining and Knowledge Discovery\u00a01, 183\u2013201 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"35_CR23","first-page":"281","volume-title":"Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability","author":"J.B. MacQueen","year":"1967","unstructured":"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.\u00a01, pp. 281\u2013297. University of California Press, Berkeley (1967)"},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1137\/S1064827597328327","volume":"21","author":"O.D. Merle","year":"2000","unstructured":"Merle, O.D., Hansen, P., Jaumard, B., Mladenovi\u2019c, N.: An Interior Point Algorithm for Minimum Sum of Squares Clustering. SIAM J. Sci. Comput.\u00a021, 1485\u20131505 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"35_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-28649-3_26","volume-title":"Pattern Recognition","author":"J. Neumann","year":"2004","unstructured":"Neumann, J., Schn\u00f6rr, C., Steidl, G.: SVM-based feature selection by direct objective minimisation. In: Rasmussen, C.E., B\u00fclthoff, H.H., Sch\u00f6lkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol.\u00a03175, pp. 212\u2013219. Springer, Heidelberg (2004)"},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1137\/1.9781611972757.14"},{"key":"35_CR27","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"D.T. Pham","year":"1998","unstructured":"Pham, D.T., Le, T.H.A.: DC Optimization Algorithms for Solving the Trust Region Subproblem. SIAM J. Optimization\u00a08, 476\u2013505 (1998)","journal-title":"SIAM J. Optimization"},{"key":"35_CR28","first-page":"191","volume":"79","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Mathematical Programming\u00a079, 191\u2013215 (1997)","journal-title":"Mathematical Programming"},{"key":"35_CR29","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)"},{"key":"35_CR30","unstructured":"Ronan, C., Fabian, S., Jason, W., L\u00e9on, B.: Trading Convexity for Scalability. In: International Conference on Machine Learning ICML (2006)"},{"key":"35_CR31","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1198\/016214503000000639","volume":"98","author":"X. Shen","year":"2003","unstructured":"Shen, X., Tseng, G.C., Zhang, X., Wong, W.H.: \u03c8 -Learning. Journal of American Statistical Association\u00a098, 724\u2013734 (2003)","journal-title":"Journal of American Statistical Association"},{"key":"35_CR32","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10898-004-2706-7","volume":"32","author":"H.D. Sherali","year":"2005","unstructured":"Sherali, H.D., Desai, J.: A global Optimization RLT-based Approach for Solving the Hard Clustering Problem. Journal of Global Optimization\u00a032, 281\u2013306 (2005)","journal-title":"Journal of Global Optimization"},{"key":"35_CR33","volume-title":"Advances in Neural Information Processing System","author":"A.L. Yuille","year":"2002","unstructured":"Yuille, A.L., Rangarajan, A.: The Convex Concave Procedure (CCCP). In: Advances in Neural Information Processing System, vol.\u00a014. MIT Press, Cambrige (2002)"}],"container-title":["Lecture Notes in Computer Science","Emerging Intelligent Computing Technology and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04020-7_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T04:19:01Z","timestamp":1739333941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04020-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040191","9783642040207"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04020-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}