{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:14:58Z","timestamp":1783700098123,"version":"3.55.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772020"],"award-info":[{"award-number":["61772020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["HKRGC"],"award-info":[{"award-number":["HKRGC"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["CUHK14301718"],"award-info":[{"award-number":["CUHK14301718"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["CityU11301120"],"award-info":[{"award-number":["CityU11301120"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["C1013-21GF"],"award-info":[{"award-number":["C1013-21GF"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007567","name":"City University of Hong Kong","doi-asserted-by":"publisher","award":["9380101"],"award-info":[{"award-number":["9380101"]}],"id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1109\/tkde.2023.3342209","type":"journal-article","created":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T19:53:01Z","timestamp":1702497181000},"page":"6653-6666","source":"Crossref","is-referenced-by-count":17,"title":["Multi-Prototypes Convex Merging Based K-Means Clustering Algorithm"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7104-1921","authenticated-orcid":false,"given":"Dong","family":"Li","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Xidian University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4764-9483","authenticated-orcid":false,"given":"Shuisheng","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Xidian University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0688-202X","authenticated-orcid":false,"given":"Tieyong","family":"Zeng","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0910-4685","authenticated-orcid":false,"given":"Raymond H.","family":"Chan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, City University of Hong Kong, Kowloon Tong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaa8415"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2424995"},{"issue":"5","key":"ref3","first-page":"2829","article-title":"Artificial intelligence: A modern approach","volume":"263","author":"Nilsson","year":"2003","journal-title":"Appl. Mechanics Mater."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/34.824819"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/83.847836"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.06.053"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1238-7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2021.3085739"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(99)00069-0"},{"key":"ref12","first-page":"1027","article-title":"K-means : The advantages of careful seeding","volume-title":"Proc. 18th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Arthur"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"ref14","first-page":"3662","article-title":"A better k-means algorithm via local search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lattanzi"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/050641983"},{"key":"ref16","article-title":"The hardness of k-means clustering","author":"Dasgupta","year":"2008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.09.012"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.2009.39"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-016-3322-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.02.015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2020.3002926"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2004559"},{"key":"ref23","first-page":"203","article-title":"A probabilistic analysis of EM for mixtures of separated, spherical gaussians","volume":"8","author":"Dasgupta","year":"2007","journal-title":"J. Mach. Learn. Res."},{"key":"ref24","first-page":"1211","article-title":"Empirical study of the benefits of overparameterization in learning latent variable models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Buhai"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2011.2182354"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.28"},{"key":"ref27","first-page":"7965","article-title":"Label consistency in overfitted generalized k-means","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2011.2174633"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2916196"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3027068"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2011.5967659"},{"key":"ref32","first-page":"1619","article-title":"Convex optimization procedure for clustering: Theoretical revisit","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref33","first-page":"2769","article-title":"Clustering by sum of norms: Stochastic incremental algorithm, convergence and cluster recovery","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Panahi"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2014.948181"},{"issue":"9","key":"ref35","first-page":"1","article-title":"Convex clustering: Model, theoretical guarantee and efficient algorithm","volume":"22","author":"Sun","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3122465"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1126\/science.1136800"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2988796"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2704779"},{"key":"ref40","first-page":"405","article-title":"Clustering by means of medoids","volume-title":"Data Analysis Based on the L1-Norm and Related Methods","author":"Kaufmann","year":"1987"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2016.07.002"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2887115"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2013.2286993"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2016.2604009"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10709365\/10356842.pdf?arnumber=10356842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T11:23:32Z","timestamp":1728559412000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10356842\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":45,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3342209","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}