{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:23:08Z","timestamp":1772724188283,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662493892","type":"print"},{"value":"9783662493908","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49390-8_65","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T18:17:15Z","timestamp":1457374635000},"page":"671-680","source":"Crossref","is-referenced-by-count":2,"title":["Robust Optimization for Clustering"],"prefix":"10.1007","author":[{"given":"Xuan Thanh","family":"Vo","sequence":"first","affiliation":[]},{"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Pham Dinh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"key":"65_CR2","first-page":"368","volume-title":"NIPS 9","author":"PS Bradley","year":"1997","unstructured":"Bradley, P.S., Mangasarian, O.L., Street, W.N.: Clustering via concave minimization. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) NIPS 9, pp. 368\u2013374. MIT Press, Cambridge, MA (1997)"},{"key":"65_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J CLASSIF 2, 193\u2013218 (1985)","journal-title":"J CLASSIF"},{"issue":"7","key":"65_CR4","doi-asserted-by":"publisher","first-page":"610","DOI":"10.14778\/2180912.2180914","volume":"5","author":"F Gullo","year":"2012","unstructured":"Gullo, F., Tagarelli, A.: Uncertain centroid based partitional clustering of uncertain data. Proc. VLDB Endowment (ACM) 5(7), 610\u2013621 (2012)","journal-title":"Proc. VLDB Endowment (ACM)"},{"key":"65_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"HA Le Thi","year":"2008","unstructured":"Le Thi, H.A., Le, H.M., Nguyen, V.V., Pham, D.T.: A DC programming approach for feature selection in support vector machines learning. J. Adv. Data Anal. Classif. 2, 259\u2013278 (2008)","journal-title":"J. Adv. Data Anal. Classif."},{"key":"65_CR6","first-page":"1","volume":"2","author":"HA Le Thi","year":"2007","unstructured":"Le Thi, H.A., Le, H.M., Pham, D.T.: Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms. J. Adv. Data Anal. Classif. 2, 1\u201320 (2007)","journal-title":"J. Adv. Data Anal. Classif."},{"issue":"4","key":"65_CR7","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1007\/s10898-012-9859-6","volume":"56","author":"HA Le Thi","year":"2013","unstructured":"Le Thi, H.A., Le, H.M., Pham, D.T., Huynh, V.N.: Binary classification via spherical separator by DC programming and DCA. J. Global Optim. 56(4), 1393\u20131407 (2013)","journal-title":"J. Global Optim."},{"key":"65_CR8","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-00293-4_4","volume-title":"Advanced Computational Methods for Knowledge Engineering","author":"LTH An","year":"2013","unstructured":"An, L.T.H., Cuong, N.M.: Efficient algorithms for feature selection in multi-class support vector machine. In: Nguyen, N.T., van Do, T., Thi, H.A. (eds.) ICCSAMA 2013. SCI, vol. 479, pp. 41\u201352. Springer, Heidelberg (2013)"},{"key":"65_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-3-642-39736-3_12","volume-title":"Advances in Data Mining","author":"HA Le Thi","year":"2013","unstructured":"Le Thi, H.A., Vo, X.T., Pham, D.T.: Robust feature selection for SVMs under uncertain data. In: Perner, P. (ed.) ICDM 2013. LNCS, vol. 7987, pp. 151\u2013165. Springer, Heidelberg (2013)"},{"issue":"1-3","key":"65_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10994-014-5455-y","volume":"101","author":"Hoai An Le Thi","year":"2014","unstructured":"Le Thi, H.A., Le, H.M., Pham, D.T.: Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm. MachineLearning (published online 04.07.14). doi:10.1007\/s10994-014-5455-y","journal-title":"Machine Learning"},{"issue":"1","key":"65_CR11","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.patcog.2013.07.012","volume":"47","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Le, H.M., Pham, D.T.: New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recogn. 47(1), 388\u2013401 (2014)","journal-title":"Pattern Recogn."},{"key":"65_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.neunet.2014.06.011","volume":"59","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Vo, X.T., Pham, D.T.: Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms. Neural Netw. 59, 36\u201350 (2014)","journal-title":"Neural Netw."},{"issue":"12","key":"65_CR13","doi-asserted-by":"publisher","first-page":"2827","DOI":"10.1162\/NECO_a_00673","volume":"26","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Nguyen, M.C., Pham, D.T.: A DC programming approach for finding communities in networks. Neural Comput. 26(12), 2827\u20132854 (2014)","journal-title":"Neural Comput."},{"issue":"1","key":"65_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"HA Le Thi","year":"2015","unstructured":"Le Thi, H.A., Pham, D.T., Le, H.M., Vo, X.T.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1), 26\u201346 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"65_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi, H.A., Pham, D.T.: The DC (difference of convex functions) Programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"65_CR16","first-page":"593","volume":"37","author":"HA Le Thi","year":"2006","unstructured":"Le Thi, H.A., Belghiti, T., Pham, D.T.: A new efficient algorithm based on DC programming and DCA for clustering. J. Glob. Optim. 37, 593\u2013608 (2006)","journal-title":"J. Glob. Optim."},{"key":"65_CR17","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.ejor.2005.07.028","volume":"183","author":"HA Le Thi","year":"2007","unstructured":"Le Thi, H.A., Le, H.M., Pham, D.T.: Optimization based DC programming and DCA for hierarchical clustering. Eur. J. Oper. Res. 183, 1067\u20131085 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"65_CR18","first-page":"289","volume":"22","author":"DT Pham","year":"1997","unstructured":"Pham, D.T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnamica 22(1), 289\u2013357 (1997)","journal-title":"Acta Math. Vietnamica"},{"issue":"1","key":"65_CR19","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.patcog.2013.07.012","volume":"47","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Le, H.M., Pham, D.T.: New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recogn. 47(1), 388\u2013401 (2014)","journal-title":"Pattern Recogn."},{"key":"65_CR20","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297 (1967)"},{"key":"65_CR21","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"DT Pham","year":"1998","unstructured":"Pham, D.T., Le Thi, H.A.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Oppt. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Oppt."},{"key":"65_CR22","first-page":"1485","volume":"10","author":"H Xu","year":"2009","unstructured":"Xu, H., Caramanis, C., Mannor, S.: Robustness and regularization of support vector machines. J. Mach. Learn. Res. 10, 1485\u20131510 (2009)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49390-8_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T13:00:17Z","timestamp":1720789217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-49390-8_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493892","9783662493908"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49390-8_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}