{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T10:40:11Z","timestamp":1750156811123,"version":"3.41.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00500-025-10662-4","type":"journal-article","created":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T09:02:52Z","timestamp":1747126972000},"page":"4275-4285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new model and DCA based algorithm for clustering"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2239-2100","authenticated-orcid":false,"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,13]]},"reference":[{"key":"10662_CR1","doi-asserted-by":"crossref","unstructured":"Arora S, Kannan R (2001) Learning mixtures of arbitrary gaussians. In: Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp 247\u2013257","DOI":"10.1145\/380752.380808"},{"issue":"4","key":"10662_CR2","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.patcog.2010.10.018","volume":"44","author":"AM Bagirov","year":"2011","unstructured":"Bagirov AM, Ugon J, Webb D (2011) Fast modified global k-means algorithm for incremental cluster construction. Pattern Recogn 44(4):866\u2013876","journal-title":"Pattern Recogn"},{"key":"10662_CR3","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.csda.2012.12.008","volume":"71","author":"C Bouveyron","year":"2014","unstructured":"Bouveyron C, Brunet-Saumard C (2014) Model-based clustering of high-dimensional data: a review. Comput Stat Data Anal 71:52\u201378","journal-title":"Comput Stat Data Anal"},{"issue":"2","key":"10662_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11336-004-1218-1","volume":"71","author":"M Brusco","year":"2006","unstructured":"Brusco M (2006) A repetitive branch-and-bound procedure for minimum within-cluster sum of squares partitioning. Psychometrika 71(2):347\u2013363","journal-title":"Psychometrika"},{"issue":"4","key":"10662_CR5","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1080\/10618600.2014.948181","volume":"24","author":"EC Chi","year":"2015","unstructured":"Chi EC, Lange K (2015) Splitting methods for convex clustering. J Comput Graph Stat 24(4):994\u20131013","journal-title":"J Comput Graph Stat"},{"issue":"1","key":"10662_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. J R Stat Soc Series B 39(1):1\u201338","journal-title":"J R Stat Soc Series B"},{"key":"10662_CR7","volume-title":"Pattern classification and scene analysis. A Wiley Interscience Publication","author":"RO Duda","year":"1973","unstructured":"Duda RO, Hart PE (1973) Pattern classification and scene analysis. A Wiley Interscience Publication. Wiley, New York"},{"key":"10662_CR8","doi-asserted-by":"crossref","unstructured":"Feder T, Greene D (1988) Optimal algorithms for approximate clustering. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp 434\u2013444","DOI":"10.1145\/62212.62255"},{"key":"10662_CR9","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman J, Hastie T, Hoefling H et al (2007) Pathwise coordinate optimization. Ann Appl Stat 1:302\u2013332","journal-title":"Ann Appl Stat"},{"issue":"1","key":"10662_CR10","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1214\/16-EJS1135","volume":"10","author":"C Gao","year":"2016","unstructured":"Gao C, Zhu Y, Shen X et al (2016) Estimation of multiple networks in Gaussian mixture models. Electron J Stat 10(1):1133\u20131154","journal-title":"Electron J Stat"},{"key":"10662_CR11","unstructured":"Hamerly G, Elkan C, et al. (2003) Learning the k in k-means. In: NIPS, pp 281\u2013288"},{"issue":"1\u20133","key":"10662_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02614317","volume":"79","author":"P Hansen","year":"1997","unstructured":"Hansen P, Jaumard B (1997) Cluster analysis and mathematical programming. Math Program 79(1\u20133):191\u2013215","journal-title":"Math Program"},{"key":"10662_CR13","unstructured":"Hocking TD, Joulin A, Bach F (2011) Clusterpath: an algorithm for clustering using convex fusion penalties. In: the 28th International Conference on Machine Learning, pp 745\u2013752"},{"key":"10662_CR14","first-page":"147","volume":"27","author":"T Huang","year":"2017","unstructured":"Huang T, Peng H, Zhang K (2017) Model selection for Gaussian mixture models. Stat Sin 27:147\u2013169","journal-title":"Stat Sin"},{"issue":"8","key":"10662_CR15","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond k-means. Pattern Recogn Lett 31(8):651\u2013666","journal-title":"Pattern Recogn Lett"},{"issue":"1","key":"10662_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi HA, Pham Dinh T (2018) DC programming and DCA: thirty years of developments. Math Program 169(1):5\u201368","journal-title":"Math Program"},{"issue":"3","key":"10662_CR17","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10898-023-01272-1","volume":"88","author":"HA Le Thi","year":"2024","unstructured":"Le Thi HA, Pham Dinh T (2024) Open issues and recent advances in DC programming and DCA. J Global Optim 88(3):533\u2013590","journal-title":"J Global Optim"},{"issue":"4","key":"10662_CR18","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10898-006-9066-4","volume":"37","author":"HA Le Thi","year":"2007","unstructured":"Le Thi HA, Belghiti MT, Pham Dinh T (2007) A new efficient algorithm based on DC programming and DCA for clustering. J Global Optim 37(4):593\u2013608","journal-title":"J Global Optim"},{"key":"10662_CR19","doi-asserted-by":"crossref","unstructured":"Lindsten F, Ohlsson H, Ljung L (2011) Clustering using sum-of-norms regularization: With application to particle filter output computation. In: 2011 IEEE Statistical Signal Processing Workshop (SSP), pp 201\u2013204","DOI":"10.1109\/SSP.2011.5967659"},{"key":"10662_CR20","volume-title":"Mixture models: inference and applications to clustering","author":"G Mclachlan","year":"1988","unstructured":"Mclachlan G, Basford K (1988) Mixture models: inference and applications to clustering. Marcel Dekker, New York"},{"key":"10662_CR21","unstructured":"Pan W, Shen X, Liu B (2013) Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty. J Mach Learn Res 14(1):1865\u20131889"},{"key":"10662_CR22","unstructured":"Pelckmans K, De Brabanter J, Suykens J, et\u00a0al (2005) Convex clustering shrinkage. In: PASCAL Workshop on Statistics and Optimization of Clustering"},{"key":"10662_CR23","unstructured":"Pelleg D, Moore AW (2000) X-means: Extending K-means with Efficient Estimation of the Number of Clusters. In: Proceedings of the Seventeenth International Conference on Machine Learning. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, ICML \u201900, pp 727\u2013734"},{"key":"10662_CR24","doi-asserted-by":"crossref","unstructured":"Peng J, Xia Y (2005) A cutting algorithm for the minimum sum-of-squared error clustering. In: Proceedings of the 2005 SIAM International Conference on Data Mining, pp 150\u2013160","DOI":"10.1137\/1.9781611972757.14"},{"issue":"1","key":"10662_CR25","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh T, Le Thi HA (1997) Convex analysis approach to D.C. programming: Theory, algorithm and applications. Acta Math Vietnam 22(1):289\u2013355","journal-title":"Acta Math Vietnam"},{"key":"10662_CR26","doi-asserted-by":"crossref","unstructured":"Pham\u00a0Dinh T (1986) Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients. In: Hiriart-Urruty JB (ed) Fermat Days 85: Mathematics for Optimization, North-Holland Mathematics Studies, vol 129. North-Holland, p 249 \u2013 271","DOI":"10.1016\/S0304-0208(08)72402-2"},{"issue":"1","key":"10662_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.32614\/RJ-2016-021","volume":"8","author":"L Scrucca","year":"2016","unstructured":"Scrucca L, Fop M, Murphy TB et al (2016) Mclust 5: clustering, classification and density estimation using Gaussian finite mixture models. R J 8(1):289\u2013317","journal-title":"R J"},{"issue":"2","key":"10662_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10898-004-2706-7","volume":"32","author":"H Sherali","year":"2005","unstructured":"Sherali H, Desai J (2005) A global optimization rlt-based approach for solving the hard clustering problem. J Glob Optim 32(2):281\u2013306","journal-title":"J Glob Optim"},{"issue":"2","key":"10662_CR29","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1111\/1467-9868.00293","volume":"63","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani R, Walther G, Hastie T (2001) Estimating the number of clusters in a data set via the gap statistic. J R Stat Soc Series B 63(2):411\u2013423","journal-title":"J R Stat Soc Series B"},{"issue":"2","key":"10662_CR30","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1109\/TNN.2009.2036998","volume":"21","author":"F Wang","year":"2010","unstructured":"Wang F, Zhao B, Zhang C (2010) Linear time maximum margin clustering. IEEE Trans Neural Netw 21(2):319\u2013332","journal-title":"IEEE Trans Neural Netw"},{"issue":"1","key":"10662_CR31","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1214\/07-AOAS147","volume":"2","author":"TT Wu","year":"2008","unstructured":"Wu TT, Lange K (2008) Coordinate descent algorithms for lasso penalized regression. Ann Appl Stat 2(1):224\u2013244","journal-title":"Ann Appl Stat"},{"issue":"188","key":"10662_CR32","first-page":"1","volume":"17","author":"C Wu","year":"2016","unstructured":"Wu C, Kwon S, Shen X et al (2016) A new algorithm and theory for penalized regression-based clustering. J Mach Learn Res 17(188):1\u201325","journal-title":"J Mach Learn Res"},{"key":"10662_CR33","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.patcog.2010.07.004","volume":"44","author":"AE Xavier","year":"2011","unstructured":"Xavier AE, Xavier VL (2011) Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions. Pattern Recogn 44:70\u201377","journal-title":"Pattern Recogn"},{"issue":"4","key":"10662_CR34","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TNN.2008.2010620","volume":"20","author":"K Zhang","year":"2009","unstructured":"Zhang K, Tsang IW, Kwok JT (2009) Maximum margin clustering made practical. IEEE Trans Neural Netw 20(4):583\u2013596","journal-title":"IEEE Trans Neural Netw"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10662-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10662-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10662-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T10:19:37Z","timestamp":1750155577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10662-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["10662"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10662-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2025,4]]},"assertion":[{"value":"8 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest and no Conflict of interest to declare that are relevant to the content of this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}