{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T14:26:12Z","timestamp":1772547972853,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["22K12150"],"award-info":[{"award-number":["22K12150"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10994-026-07013-1","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T10:01:21Z","timestamp":1772532081000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Convex Clustering: Convexity, Bounding Balls and Characteristics"],"prefix":"10.1007","volume":"115","author":[{"given":"Canh Hao","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Mamitsuka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,3]]},"reference":[{"key":"7013_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1613\/jair.1.14883","volume":"78","author":"A Agrawal","year":"2023","unstructured":"Agrawal, A., Inamdar, T., Saurabh, S., & Xue, J. (2023). Clustering what matters: Optimal approximation for clustering with outliers. Journal of Artificial Intelligence Research, 78, 143\u2013166.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"7013_CR2","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1080\/10618600.2014.948181","volume":"24","author":"EC Chi","year":"2015","unstructured":"Chi, E. C., & Lange, K. (2015). Splitting methods for convex clustering. Journal of Computational and Graphical Statistics, 24(4), 994\u20131013.","journal-title":"Journal of Computational and Graphical Statistics"},{"issue":"3","key":"7013_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1137\/18M121099X","volume":"1","author":"EC Chi","year":"2019","unstructured":"Chi, E. C., & Steinerberger, S. (2019). Recovering trees with convex clustering. SIAM Journal on Mathematics of Data Science, 1(3), 383\u2013407.","journal-title":"SIAM Journal on Mathematics of Data Science"},{"issue":"4","key":"7013_CR4","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1007\/s11634-018-0350-1","volume":"13","author":"H Choi","year":"2019","unstructured":"Choi, H., & Lee, S. (2019). Convex clustering for binary data. Advances in Data Analysis and Classification, 13(4), 991\u20131018.","journal-title":"Advances in Data Analysis and Classification"},{"issue":"7","key":"7013_CR5","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1080\/00949655.2019.1576045","volume":"89","author":"H Choi","year":"2019","unstructured":"Choi, H., Poythress, J. C., Park, C., Jeon, J.-J., & Park, C. (2019). Regularized boxplot via convex clustering. Journal of Statistical Computation and Simulation, 89(7), 1227\u20131247.","journal-title":"Journal of Statistical Computation and Simulation"},{"issue":"2","key":"7013_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1080\/00401706.2020.1733094","volume":"63","author":"S Chu","year":"2021","unstructured":"Chu, S., Jiang, H., Xue, Z., & Deng, X. (2021). Adaptive convex clustering of generalized linear models with application in purchase likelihood prediction. Technometrics, 63(2), 171\u2013183.","journal-title":"Technometrics"},{"key":"7013_CR7","doi-asserted-by":"crossref","unstructured":"Condat, L. (2017). A convex approach to k-means clustering and image segmentation. In: EMMCVPR 2017\u201311th international conference on energy minimization methods in computer vision and pattern recognition, Venise, Italy.","DOI":"10.1007\/978-3-319-78199-0_15"},{"issue":"4","key":"7013_CR8","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1137\/21M1448732","volume":"4","author":"A Dunlap","year":"2022","unstructured":"Dunlap, A., & Mourrat, J.-C. (2022). Local versions of sum-of-norms clustering. SIAM Journal on Mathematics of Data Science, 4(4), 1250\u20131271.","journal-title":"SIAM Journal on Mathematics of Data Science"},{"issue":"123","key":"7013_CR9","first-page":"1","volume":"25","author":"A Dunlap","year":"2024","unstructured":"Dunlap, A., & Mourrat, J.-C. (2024). Sum-of-norms clustering does not separate nearby balls. Journal of Machine Learning Research, 25(123), 1\u201340.","journal-title":"Journal of Machine Learning Research"},{"key":"7013_CR10","doi-asserted-by":"crossref","unstructured":"Hallac, D., Leskovec, J., & Boyd, S. (2015). Network lasso: Clustering and optimization in large graphs. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201915, pp. 387\u2013396. ACM, New York, NY, USA.","DOI":"10.1145\/2783258.2783313"},{"key":"7013_CR11","doi-asserted-by":"publisher","DOI":"10.1201\/b18401","volume-title":"Statistical learning with sparsity: The Lasso and generalizations","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Tibshirani, R., & Wainwright, M. (2015). Statistical learning with sparsity: The Lasso and generalizations. Chapman & Hall\/CRC."},{"key":"7013_CR12","unstructured":"Hocking, T., Vert, J., Bach, F. R., & Joulin, A. (2011). Clusterpath: an algorithm for clustering using convex fusion penalties. In: Proceedings of the 28th international conference on machine learning, ICML 2011, Bellevue, Washington, USA, June 28 - July 2, 2011, pp. 745\u2013752."},{"issue":"225","key":"7013_CR13","first-page":"1","volume":"21","author":"T Jiang","year":"2020","unstructured":"Jiang, T., Vavasis, S., & Zhai, C. W. (2020). Recovery of a mixture of gaussians by sum-of-norms clustering. Journal of Machine Learning Research, 21(225), 1\u201316.","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"7013_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02289588","volume":"32","author":"SC Johnson","year":"1967","unstructured":"Johnson, S. C. (1967). Hierarchical clustering schemes. Psychometrika, 32(3), 241\u2013254.","journal-title":"Psychometrika"},{"key":"7013_CR15","unstructured":"Kelly, M., Longjohn, R., & Nottingham, K. (2023). The UCI machine learning repository. https:\/\/archive.ics.uci.edu."},{"key":"#cr-split#-7013_CR16.1","doi-asserted-by":"crossref","unstructured":"Lindsten, F., Ohlsson, H., & Ljung, L. (2011). Clustering using sum-of-norms regularization","DOI":"10.1109\/CDC.2010.5717368"},{"key":"#cr-split#-7013_CR16.2","unstructured":"with application to particle filter output computation. In: Proceedings of the 2011 IEEE statistical signal processing workshop (SSP), pp. 201-204."},{"key":"7013_CR17","unstructured":"Liu, C., Sun, Q., & Tan, K. M. (2019). Robust convex clustering: How does fusion penalty enhance robustness."},{"issue":"23","key":"7013_CR18","doi-asserted-by":"publisher","first-page":"33279","DOI":"10.1007\/s11042-019-7663-8","volume":"78","author":"T Liu","year":"2019","unstructured":"Liu, T., Zhu, J., Zhou, J., Zhu, Y., & Zhu, X. (2019). Initialization-similarity clustering algorithm. Multimedia Tools and Applications, 78(23), 33279\u201333296.","journal-title":"Multimedia Tools and Applications"},{"issue":"2","key":"7013_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129\u2013136.","journal-title":"IEEE Transactions on Information Theory"},{"key":"7013_CR20","unstructured":"MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth berkeley symposium on mathematical statistics and probability, Volume 1: Statistics, pp. 281\u2013297. University of California Press, California."},{"issue":"517","key":"7013_CR21","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1080\/01621459.2016.1148039","volume":"112","author":"S Ma","year":"2017","unstructured":"Ma, S., & Huang, J. (2017). A concave pairwise fusion approach to subgroup analysis. Journal of the American Statistical Association, 112(517), 410\u2013423.","journal-title":"Journal of the American Statistical Association"},{"key":"7013_CR22","doi-asserted-by":"crossref","unstructured":"Nguyen, C. H., & Mamitsuka, H. (2020). Learning on hypergraphs with sparsity. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI).","DOI":"10.1109\/TPAMI.2020.2974746"},{"issue":"6","key":"7013_CR23","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1109\/TCYB.2016.2546965","volume":"47","author":"L Niu","year":"2017","unstructured":"Niu, L., Zhou, R., Tian, Y., Qi, Z., & Zhang, P. (2017). Nonsmooth penalized clustering via $$l_p$$ regularized sparse regression. IEEE Transactions on Cybernetics, 47(6), 1423\u20131433.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"7013_CR24","unstructured":"Panahi, A., Dubhashi, D., Johansson, F. D., & Bhattacharyya, C. (2017). Clustering by sum of norms: Stochastic incremental algorithm, convergence and cluster recovery. In: Proceedings of the 34th international conference on machine learning. Proceedings of Machine Learning Research, vol. 70, pp. 2769\u20132777. PMLR, International Convention Centre, Sydney, Australia."},{"key":"7013_CR25","unstructured":"Pelckmans, K., Brabanter, J. D., Suykens, J. A. K., & Moor, B. L. R. D. (2005). Convex clustering shrinkage. In: PASCAL workshop on statistics and optimization of clustering workshop."},{"key":"7013_CR26","doi-asserted-by":"crossref","unstructured":"Poddar, S., & Jacob, M. (2018). Clustering of data with missing entries. Speech and Signal Processing, ICASSP 2018. 2018 IEEE International Conference on Acoustics (pp. 2831\u20132835). Calgary, AB, Canada: IEEE.","DOI":"10.1109\/ICASSP.2018.8462602"},{"issue":"3","key":"7013_CR27","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1111\/rssb.12226","volume":"79","author":"P Radchenko","year":"2017","unstructured":"Radchenko, P., & Mukherjee, G. (2017). Convex clustering via l1 fusion penalization. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 79(3), 1527\u20131546.","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"issue":"1\u20134","key":"7013_CR28","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L. I., Osher, S., & Fatemi, E. (1992). Nonlinear total variation based noise removal algorithms. Physica D, 60(1\u20134), 259\u2013268.","journal-title":"Physica D"},{"issue":"37","key":"7013_CR29","doi-asserted-by":"publisher","first-page":"9814","DOI":"10.1073\/pnas.1700770114","volume":"114","author":"SA Shah","year":"2017","unstructured":"Shah, S. A., & Koltun, V. (2017). Robust continuous clustering. Proceedings of the National academy of Sciences of the United States of America, 114(37), 9814\u20139819.","journal-title":"Proceedings of the National academy of Sciences of the United States of America"},{"key":"7013_CR30","first-page":"9","volume":"22","author":"D Sun","year":"2021","unstructured":"Sun, D., Toh, K., & Yuan, Y. (2021). Convex clustering: Model, theoretical guarantee and efficient algorithm. Journal of Machine Learning Research, 22, 9\u20131932.","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"7013_CR31","doi-asserted-by":"publisher","first-page":"2324","DOI":"10.1214\/15-EJS1074","volume":"9","author":"KM Tan","year":"2015","unstructured":"Tan, K. M., & Witten, D. M. (2015). Statistical properties of convex clustering. Electronic Journal of Statistics, 9(2), 2324\u20132347.","journal-title":"Electronic Journal of Statistics"},{"issue":"1","key":"7013_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., & Knight, K. (2005). Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society: Series B, 67(1), 91\u2013108.","journal-title":"Journal of the Royal Statistical Society: Series B"},{"key":"7013_CR37","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1080\/10618600.2017.1377081","volume":"27","author":"B Wang","year":"2018","unstructured":"Wang, B., Zhang, Y., Sun, W., & Fang, Y. (2018). Sparse convex clustering. Journal of Computational and Graphical Statistics, 27, 393\u2013403.","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"7013_CR35","first-page":"55","volume":"22","author":"M Wang","year":"2021","unstructured":"Wang, M., & Allen, G. I. (2021). Integrative generalized convex clustering optimization and feature selection for mixed multi-view data. Journal of Machine Learning Research, 22, 55\u201315573.","journal-title":"Journal of Machine Learning Research"},{"key":"7013_CR33","doi-asserted-by":"crossref","unstructured":"Wang, Q., Gong, P., Chang, S., Huang, T. S., & Zhou, J. (2016). Robust convex clustering analysis. In: Data mining (ICDM), 2016 IEEE 16th international conference on, pp. 1263\u20131268. IEEE.","DOI":"10.1109\/ICDM.2016.0170"},{"key":"7013_CR36","doi-asserted-by":"publisher","first-page":"5273","DOI":"10.1109\/TSP.2021.3102106","volume":"69","author":"S Wang","year":"2021","unstructured":"Wang, S., Chang, T., Cui, Y., & Pang, J. (2021). Clustering by orthogonal NMF model and non-convex penalty optimization. IEEE Transactions on Signal Processing, 69, 5273\u20135288.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"7013_CR34","unstructured":"Wang, Y. -X., Sharpnack, J., Smola, A., & Tibshirani, R. (2015). Trend filtering on graphs. In: Lebanon, G., Vishwanathan, S. V. N. (eds.) Proceedings of the eighteenth international conference on artificial intelligence and statistics. Proceedings of Machine Learning Research, vol. 38, pp. 1042\u20131050. PMLR, San Diego, California, USA."},{"key":"7013_CR38","doi-asserted-by":"crossref","unstructured":"Weylandt, M., & Michailidis, G. (2021). Automatic registration and clustering of time series. Speech and Signal Processing, ICASSP. IEEE international conference on acoustics (pp. 5609\u20135613). ON, Canada: IEEE.","DOI":"10.1109\/ICASSP39728.2021.9414417"},{"issue":"3","key":"7013_CR40","doi-asserted-by":"publisher","first-page":"2294","DOI":"10.1137\/21M1441080","volume":"32","author":"Y Yuan","year":"2022","unstructured":"Yuan, Y., Chang, T., Sun, D., & Toh, K. (2022). A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering. SIAM Journal on Optimization, 32(3), 2294\u20132318.","journal-title":"SIAM Journal on Optimization"},{"key":"7013_CR39","unstructured":"Yuan, Y., Sun, D., & Toh, K.-C. (2018). An efficient semismooth Newton based algorithm for convex clustering. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th international conference on machine learning. Proceedings of Machine Learning Research, vol. 80, pp. 5718\u20135726. PMLR, MA."},{"key":"7013_CR41","unstructured":"Zhu, C., Xu, H., Leng, C., & Yan, S. (2014). Convex optimization procedure for clustering: Theoretical revisit. In: NIPS."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07013-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-026-07013-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07013-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T10:01:54Z","timestamp":1772532114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-026-07013-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["7013"],"URL":"https:\/\/doi.org\/10.1007\/s10994-026-07013-1","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"28 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"52"}}