{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T04:17:04Z","timestamp":1773116224307,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T00:00:00Z","timestamp":1667865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T00:00:00Z","timestamp":1667865600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Convex clustering has received recently an increased interest as a valuable method for unsupervised learning. Unlike conventional clustering methods such as k-means, its formulation corresponds to solving a convex optimization problem and hence, alleviates initialization and local minima problems. However, while several algorithms have been proposed to solve convex clustering formulations, including those based on the alternating direction method of multipliers (ADMM), there is currently a limited body of work on developing scalable<jats:italic>parallel and distributed<\/jats:italic>algorithms and solvers for convex clustering. In this paper, we develop a parallel, ADMM-based method, for a modified convex clustering sum-of-norms (SON) formulation for master\u2013worker architectures, where the data to be clustered are partitioned across a number of worker nodes, and we provide its efficient, open-source implementation (available on Parallel ADMM-based convex clustering.<jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/lidijaf\/Parallel-ADMM-based-convex-clustering\">https:\/\/github.com\/lidijaf\/Parallel-ADMM-based-convex-clustering<\/jats:ext-link>. Accessed on 10 June 2022) for high-performance computing (HPC) cluster environments. Extensive numerical evaluations on real and synthetic data sets demonstrate a high degree of scalability and efficiency of the method, when compared with existing alternative solvers for convex clustering.<\/jats:p>","DOI":"10.1186\/s13634-022-00942-8","type":"journal-article","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T06:02:36Z","timestamp":1667887356000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A parallel ADMM-based convex clustering method"],"prefix":"10.1186","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8199-7767","authenticated-orcid":false,"given":"Lidija","family":"Fodor","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Du\u0161an","family":"Jakoveti\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Danijela","family":"Boberi\u0107 Krsti\u0107ev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Sr\u0111an","family":"\u0160krbi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,8]]},"reference":[{"issue":"11","key":"942_CR1","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1016\/j.patcog.2005.01.025","volume":"38","author":"T Warren Liao","year":"2005","unstructured":"T. Warren Liao, Clustering of time series data\u2014a survey. Pattern Recogn. 38(11), 1857\u20131874 (2005). https:\/\/doi.org\/10.1016\/j.patcog.2005.01.025","journal-title":"Pattern Recogn."},{"issue":"1","key":"942_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.omega.2013.05.007","volume":"42","author":"X Dai","year":"2014","unstructured":"X. Dai, T. Kuosmanen, Best-practice benchmarking using clustering methods: application to energy regulation. Omega 42(1), 179\u2013188 (2014). https:\/\/doi.org\/10.1016\/j.omega.2013.05.007","journal-title":"Omega"},{"issue":"2","key":"942_CR3","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1016\/j.asoc.2010.05.005","volume":"11","author":"T Chaira","year":"2011","unstructured":"T. Chaira, A novel intuitionistic fuzzy C means clustering algorithm and its application to medical images. Appl. Soft Comput. 11(2), 1711\u20131717 (2011). https:\/\/doi.org\/10.1016\/j.asoc.2010.05.005","journal-title":"Appl. Soft Comput."},{"key":"942_CR4","doi-asserted-by":"publisher","unstructured":"F. Lindsten, H. Ohlsson, L. Ljung, Clustering using sum-of-norms regularization: with application to particle filter output computation, in 2011 IEEE Statistical Signal Processing Workshop (SSP) (2011), pp. 201\u2013204. https:\/\/doi.org\/10.1109\/SSP.2011.5967659","DOI":"10.1109\/SSP.2011.5967659"},{"issue":"2","key":"942_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"S. Lloyd, Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"key":"942_CR6","unstructured":"D. Arthur, S. Vassilvitskii, K-means++: the advantages of careful seeding, in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201907 (Society for Industrial and Applied Mathematics, USA, 2007), pp. 1027\u20131035"},{"key":"942_CR7","doi-asserted-by":"publisher","unstructured":"S. Arora, P. Raghavan, S. Rao, Approximation schemes for Euclidean k-medians and related problems, in Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. STOC \u201998 (Association for Computing Machinery, New York, NY, USA, 1998), pp. 106\u2013113. https:\/\/doi.org\/10.1145\/276698.276718","DOI":"10.1145\/276698.276718"},{"issue":"58","key":"942_CR8","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1137\/1.9781611972740.22","volume":"6","author":"A Banerjee","year":"2005","unstructured":"A. Banerjee, S. Merugu, I.S. Dhillon, J. Ghosh, Clustering with Bregman divergences. J. Mach. Learn. Res. 6(58), 1705\u20131749 (2005). https:\/\/doi.org\/10.1137\/1.9781611972740.22","journal-title":"J. Mach. Learn. Res."},{"key":"942_CR9","unstructured":"F. Lindsten, H. Ohlsson, L. Ljung, Just relax and come clustering!: a convexification of k-means clustering (2011). http:\/\/liu.diva-portal.org\/smash\/get\/diva2:650707\/FULLTEXT01.pdf"},{"issue":"4","key":"942_CR10","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1080\/10618600.2014.948181","volume":"24","author":"EC Chi","year":"2015","unstructured":"E.C. Chi, K. Lange, Splitting methods for convex clustering. J. Comput. Graph. Stat. 24(4), 994\u20131013 (2015). https:\/\/doi.org\/10.1080\/10618600.2014.948181","journal-title":"J. Comput. Graph. Stat."},{"key":"942_CR11","unstructured":"K. Pelckmans, J.D. Brabanter, B.D. Moor, J.A.K. Suykens, Convex clustering shrinkage, in Workshop on Statistics and Optimization of Clustering Workshop (PASCAL) (2005)"},{"key":"942_CR12","unstructured":"T.D. Hocking, A. Joulin, F. Bach, J.-P. Vert, Clusterpath: an algorithm for clustering using convex fusion penalties, in Proceedings of the 28th International Conference on International Conference on Machine Learning. ICML\u201911 (Omnipress, Madison, WI, USA, 2011), pp. 745\u2013752"},{"issue":"1","key":"942_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011). https:\/\/doi.org\/10.1561\/2200000016","journal-title":"Found. Trends Mach. Learn."},{"key":"942_CR14","doi-asserted-by":"crossref","unstructured":"Parallel ADMM-based convex clustering. https:\/\/github.com\/lidijaf\/Parallel-ADMM-based-convex-clustering. Accessed on 10 June 2022","DOI":"10.1186\/s13634-022-00942-8"},{"issue":"1","key":"942_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1177\/1094342015594678","volume":"31","author":"E Tejedor","year":"2017","unstructured":"E. Tejedor, Y. Becerra, G. Alomar, A. Queralt, R.M. Badia, J. Torres, T. Cortesand, J. Labarta, PyCOMPSs: parallel computational workflows in python. Int. J. High Perform. Comput. Appl. 31(1), 66\u201382 (2017). https:\/\/doi.org\/10.1177\/1094342015594678","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"942_CR16","first-page":"801","volume":"4","author":"H Steinhaus","year":"1957","unstructured":"H. Steinhaus, Sur la division des corps mat\u00e9riels en parties. Bull. Acad. Pol. Sci., Cl. III 4, 801\u2013804 (1957)","journal-title":"Bull. Acad. Pol. Sci., Cl. III"},{"issue":"10","key":"942_CR17","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/S0167-8655(99)00069-0","volume":"20","author":"JM Pe\u00f1a","year":"1999","unstructured":"J.M. Pe\u00f1a, J.A. Lozano, P. Larra\u00f1aga, An empirical comparison of four initialization methods for the k-means algorithm. Pattern Recognit. Lett. 20(10), 1027\u20131040 (1999). https:\/\/doi.org\/10.1016\/S0167-8655(99)00069-0","journal-title":"Pattern Recognit. Lett."},{"issue":"11","key":"942_CR18","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","volume":"25","author":"SS Khan","year":"2004","unstructured":"S.S. Khan, A. Ahmad, Cluster center initialization algorithm for k-means clustering. Pattern Recognit. Lett. 25(11), 1293\u20131302 (2004). https:\/\/doi.org\/10.1016\/j.patrec.2004.04.007","journal-title":"Pattern Recognit. Lett."},{"key":"942_CR19","first-page":"825","volume-title":"Convex Clustering with Exemplar-Based Models","author":"D Lashkari","year":"2007","unstructured":"D. Lashkari, P. Golland, Convex Clustering with Exemplar-Based Models (MIT Press, Cambridge, MA, 2007), pp.825\u2013832"},{"key":"942_CR20","doi-asserted-by":"publisher","unstructured":"S. Nowozin, G. Bakir, A decoupled approach to exemplar-based unsupervised learning, in Proceedings of the 25th International Conference on Machine Learning. ICML \u201908 (Association for Computing Machinery, New York, NY, USA, 2008), pp. 704\u2013711. https:\/\/doi.org\/10.1145\/1390156.1390245","DOI":"10.1145\/1390156.1390245"},{"key":"942_CR21","unstructured":"M. Wang, T. Yao, G.I. Allen, Supervised convex clustering. arXiv preprint arXiv:2005.12198 (2020)"},{"issue":"5","key":"942_CR22","doi-asserted-by":"publisher","first-page":"e1004228","DOI":"10.1371\/journal.pcbi.1004228","volume":"11","author":"GK Chen","year":"2015","unstructured":"G.K. Chen, E.C. Chi, J.M. Ranola, K. Lange, Convex clustering: an attractive alternative to hierarchical clustering. PLoS Comput. Biol. 11(5), e1004228 (2015). https:\/\/doi.org\/10.1371\/journal.pcbi.1004228","journal-title":"PLoS Comput. Biol."},{"issue":"2","key":"942_CR23","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1080\/10618600.2017.1377081","volume":"27","author":"B Wang","year":"2018","unstructured":"B. Wang, Y. Zhang, W. Sun, Y. Fang, Sparse convex clustering. J. Comput. Graph. Stat. 27(2), 393\u2013403 (2018). https:\/\/doi.org\/10.1080\/10618600.2017.1377081","journal-title":"J. Comput. Graph. Stat."},{"key":"942_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"M. Yuan, Y. Lin, Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. B 68, 49\u201367 (2006). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00532.x","journal-title":"J. R. Stat. Soc. B"},{"key":"942_CR25","unstructured":"Q. Qian, On algorithmic regularization and convex clustering. PhD thesis, SOhio State University. OhioLINK Electronic Theses and Dissertations Center (2019). http:\/\/rave.ohiolink.edu\/etdc\/view?acc_num=osu156594573920941"},{"key":"942_CR26","volume":"2020","author":"YL Huangyue Chen","year":"2020","unstructured":"Y.L. Huangyue Chen, Lingchen Kong, A novel convex clustering method for high-dimensional data using semiproximal ADMM. Math. Probl. Eng. 2020, Article ID 9216351, 12 (2020)","journal-title":"Math. Probl. Eng."},{"key":"942_CR27","doi-asserted-by":"publisher","unstructured":"S. Kar, B. Swenson, Clustering with distributed data (2019). https:\/\/doi.org\/10.48550\/ARXIV.1901.00214. arXiv:1901.00214","DOI":"10.48550\/ARXIV.1901.00214"},{"key":"942_CR28","doi-asserted-by":"publisher","unstructured":"W. Zhou, H. Yi, G. Mishne, E. Chi, Scalable algorithms for convex clustering, in 2021 IEEE Data Science and Learning Workshop (DSLW) (2021), pp. 1\u20136. https:\/\/doi.org\/10.1109\/DSLW51110.2021.9523411","DOI":"10.1109\/DSLW51110.2021.9523411"},{"key":"942_CR29","doi-asserted-by":"publisher","unstructured":"X. Zhou, C. Du, X. Cai, An Efficient Smoothing Proximal Gradient Algorithm for Convex Clustering. arXiv (2020). https:\/\/doi.org\/10.48550\/ARXIV.2006.12592. arXiv:2006.12592","DOI":"10.48550\/ARXIV.2006.12592"},{"key":"942_CR30","first-page":"1619","volume-title":"Advances in Neural Information Processing Systems","author":"C Zhu","year":"2014","unstructured":"C. Zhu, H. Xu, C. Leng, S. Yan, Convex optimization procedure for clustering: theoretical revisit, in Advances in Neural Information Processing Systems, vol. 27, ed. by Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, K.Q. Weinberger (Curran Associates Inc., New York, 2014), pp.1619\u20131627"},{"key":"942_CR31","first-page":"2769","volume-title":"Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research","author":"A Panahi","year":"2017","unstructured":"A. Panahi, D. Dubhashi, F.D. Johansson, C. Bhattacharyya, 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, ed. by D. Precup, Y.W. Teh (PMLR, Sydney, 2017), pp.2769\u20132777"},{"key":"942_CR32","first-page":"9","volume":"22","author":"D Sun","year":"2021","unstructured":"D. Sun, K.-C. Toh, Y. Yuan, Convex clustering: model, theoretical guarantee and efficient algorithm. J. Mach. Learn. Res. 22, 9\u20131932 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"942_CR33","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, K. Knight, Sparsity and smoothness via the fused lasso. J. R. Stat. Soc.: Ser. B (Stat. Methodol.) 67(1), 91\u2013108 (2005). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00490.x","journal-title":"J. R. Stat. Soc.: Ser. B (Stat. Methodol.)"},{"key":"942_CR34","unstructured":"Y. Gdalyahu, D. Weinshall, M. Werman, A randomized algorithm for pairwise clustering, in NIPS (1998)"},{"issue":"83","key":"942_CR35","first-page":"1","volume":"17","author":"S Diamond","year":"2016","unstructured":"S. Diamond, S. Boyd, CVXPY: a python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(83), 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"942_CR36","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1080\/23307706.2017.1397554","volume":"5","author":"A Agrawal","year":"2018","unstructured":"A. Agrawal, R. Verschueren, S. Diamond, S. Boyd, A rewriting system for convex optimization problems. J. Control Decis. 5(1), 42\u201360 (2018)","journal-title":"J. Control Decis."},{"issue":"1","key":"942_CR37","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1177\/1094342015594678","volume":"31","author":"E Tejedor","year":"2017","unstructured":"E. Tejedor, Y. Becerra, G. Alomar, A. Queralt, R.M. Badia, J.T. Toni Cortes, J. Labarta, PyCOMPSs: parallel computational workflows in Python. IJHPCA 31(1), 66\u201382 (2017). https:\/\/doi.org\/10.1177\/1094342015594678","journal-title":"IJHPCA"},{"key":"942_CR38","unstructured":"scikit-learn: Machine learning in Python. https:\/\/scikit-learn.org\/stable\/. Accessed on 20 March 2022"},{"key":"942_CR39","volume-title":"Advances in Neural Information Processing Systems","author":"C Rasmussen","year":"1999","unstructured":"C. Rasmussen, The infinite gaussian mixture model, in Advances in Neural Information Processing Systems, vol. 12, ed. by S. Solla, T. Leen, K. M\u00fcller (MIT Press, Cambridge, MA, 1999)"},{"key":"942_CR40","first-page":"2579","volume":"9","author":"L van der Maaten","year":"2008","unstructured":"L. van der Maaten, G. Hinton, Visualizing data using t-SNE. J. Mach. Learn. Res. 9, 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"942_CR41","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/2394164","volume":"23","author":"E Anderson","year":"1936","unstructured":"E. Anderson, The species problem in Iris. Ann. Mo. Bot. Gard. 23(3), 457\u2013509 (1936)","journal-title":"Ann. Mo. Bot. Gard."},{"key":"942_CR42","first-page":"179","volume":"7","author":"RA Fisher","year":"1936","unstructured":"R.A. Fisher, The use of multiple measurements in taxonomic problems. Ann. Hum. Genet. 7, 179\u2013188 (1936)","journal-title":"Ann. Hum. Genet."},{"key":"942_CR43","unstructured":"M. Ester, H.-P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in Proceedings of the Second International Conference on Knowledge Discovery and Data Mining. KDD\u201996 (AAAI Press, Palo Alto, CA, 1996), pp. 226\u2013231"}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-022-00942-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13634-022-00942-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-022-00942-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T12:32:38Z","timestamp":1678537958000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-022-00942-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,8]]},"references-count":43,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["942"],"URL":"https:\/\/doi.org\/10.1186\/s13634-022-00942-8","relation":{},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,8]]},"assertion":[{"value":"21 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2022","order":3,"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 that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"108"}}