{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T10:42:17Z","timestamp":1763116937354,"version":"3.37.3"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2023,5,1]]},"DOI":"10.1109\/tpami.2022.3217137","type":"journal-article","created":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T23:14:01Z","timestamp":1667517241000},"page":"5862-5871","source":"Crossref","is-referenced-by-count":5,"title":["Implicit Annealing in Kernel Spaces: A Strongly Consistent Clustering Approach"],"prefix":"10.1109","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3981-9596","authenticated-orcid":false,"given":"Debolina","family":"Paul","sequence":"first","affiliation":[{"name":"Department of Statistics, Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3668-637X","authenticated-orcid":false,"given":"Saptarshi","family":"Chakraborty","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of California, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-4508","authenticated-orcid":false,"given":"Swagatam","family":"Das","sequence":"additional","affiliation":[{"name":"Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5472-3720","authenticated-orcid":false,"given":"Jason","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Statistical Science, Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume-title":"Proc. 5th Berkeley Symp. Math. Statist. Probability","author":"MacQueen"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TIT.1982.1056489"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1162\/089976698300017467"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/1014052.1014118"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/j.patcog.2007.05.018"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/IJCNN.2008.4634069"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TNN.2009.2019722"},{"key":"ref8","first-page":"1305","article-title":"Localized data fusion for kernel k-means clustering with application to cancer biology","volume-title":"Proc. Adv. Neural Informat. Process. Syst.","author":"G\u00f6nen"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/2809890.2809896"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ICIP.2015.7351209"},{"issue":"1","key":"ref11","first-page":"5148","article-title":"Local network community detection with continuous optimization of conductance and weighted kernel k-means","volume":"17","author":"Van Laarhoven","year":"2016","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIP.2018.2796860"},{"issue":"1","key":"ref13","first-page":"431","article-title":"Scalable kernel k-means clustering with Nystr\u00f6m approximation: Relative-error bounds","volume":"20","author":"Wang","year":"2019","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.5555\/2980539.2980649"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1609\/aaai.v32i1.11613"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1609\/aaai.v32i1.11658"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TAI.2021.3065894"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1609\/aaai.v30i1.10249"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1609\/aaai.v34i04.5922"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.24963\/ijcai.2017\/418"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TKDE.2018.2873378"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.24963\/ijcai.2019\/356"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.24963\/ijcai.2019\/409"},{"key":"ref24","article-title":"Multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix","volume-title":"Pattern Recognit.","volume":"106","author":"Chen","year":"2020"},{"key":"ref25","first-page":"1704","article-title":"Multiple kernel clustering with local kernel alignment maximization","author":"Li","year":"2016","journal-title":"Proc. 25th Int. Joint Conf. Artif. Intell."},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/tpami.2019.2892416"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1609\/aaai.v28i1.8950"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.24963\/ijcai.2019\/524"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TPAMI.2018.2879108"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.24963\/ijcai.2017\/357"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/TPAMI.2020.3011148"},{"year":"2018","author":"Bang","article-title":"Robust multiple kernel k-means clustering using min-max optimization","key":"ref32"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TNN.2002.1000150"},{"key":"ref34","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":"ref35","first-page":"55","article-title":"Fast and provably good seedings for k-means","volume-title":"Proc. Adv. Neural Informat. Process. Syst.","author":"Bachem"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/TNN.2009.2019722"},{"key":"ref37","first-page":"6921","article-title":"Power k-means clustering","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref38","first-page":"691","article-title":"Entropy weighted power k-means clustering","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Chakraborty"},{"key":"ref39","article-title":"K-harmonic means\u2014A data clustering algorithm","volume":"55","author":"Zhang","year":"1999","journal-title":"Hewlett-Packard Labs Tech. Rep. HPL-1999\u2013124"},{"volume-title":"A Unified View of Kernel K-Means, Spectral Clustering and Graph Cuts","year":"2004","author":"Dhillon","key":"ref40"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1098\/rsta.1909.0016"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1137\/140957639"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1137\/1.9781611974409"},{"key":"ref44","first-page":"1385","article-title":"Generalized linear model regression under distance-to-set penalties","volume-title":"Proc. Adv. Neural Informat. Process. Syst.","author":"Xu"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1080\/10618600.2000.10474858"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1191\/096228097677258219"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1017\/CBO9780511817106"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1137\/1.9781611972719.6"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.26599\/BDMA.2018.9020003"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1137\/1.9781611972795.55"},{"key":"ref51","first-page":"3476","article-title":"Robust multiple kernel k-means using l21-norm","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Du"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1109\/TKDE.2007.1048"},{"key":"ref53","first-page":"3098","article-title":"On robustness of kernel clustering","volume-title":"Proc. Adv. Neural Informat. Process. Syst.","author":"Yan"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1214\/aos\/1176345339"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1109\/TPAMI.2020.3047489"},{"issue":"Nov","key":"ref56","first-page":"463","article-title":"Rademacher and gaussian complexities: Risk bounds and structural results","volume":"3","author":"Bartlett","year":"2002","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref57","DOI":"10.1214\/009053605000000282"},{"doi-asserted-by":"publisher","key":"ref58","DOI":"10.1093\/biomet\/59.3.665"},{"doi-asserted-by":"publisher","key":"ref59","DOI":"10.5555\/1756006.1953024"},{"year":"2020","author":"Paul","article-title":"Kernel k-means, by all means: Algorithms and strong consistency","key":"ref60"},{"issue":"Nov","key":"ref61","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref62","DOI":"10.1109\/AFGR.1998.670949"},{"year":"2017","author":"Dua","article-title":"UCI machine learning repository","key":"ref63"},{"issue":"6","key":"ref64","article-title":"Feature selection: A data perspective","volume-title":"ACM Comput. Surv.","volume":"50","author":"Li","year":"2018"},{"key":"ref65","first-page":"9357","article-title":"Statistical and computational trade-offs in kernel k-means","volume-title":"Proc. Adv. Neural Informat. Process. Syst.","author":"Calandriello"},{"issue":"1","key":"ref66","first-page":"431","article-title":"Scalable kernel k-means clustering with Nystr\u00f6m approximation: Relative-error bounds","volume":"20","author":"Wang","year":"2019","journal-title":"J. Mach. Learn. Res."},{"volume-title":"All of Nonparametric Statistics","year":"2006","author":"Wasserman","key":"ref67"},{"doi-asserted-by":"publisher","key":"ref68","DOI":"10.1109\/TFUZZ.2011.2170175"},{"doi-asserted-by":"publisher","key":"ref69","DOI":"10.1609\/aaai.v31i1.10895"},{"doi-asserted-by":"publisher","key":"ref70","DOI":"10.1109\/TKDE.2020.3014104"},{"doi-asserted-by":"publisher","key":"ref71","DOI":"10.1109\/TNNLS.2020.3026532"},{"key":"ref72","first-page":"6850","article-title":"One pass late fusion multi-view clustering","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu"},{"doi-asserted-by":"publisher","key":"ref73","DOI":"10.1109\/tnnls.2021.3093426"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/10091695\/09928792.pdf?arnumber=9928792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T19:53:19Z","timestamp":1719345199000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9928792\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,1]]},"references-count":73,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2022.3217137","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"},{"type":"electronic","value":"1939-3539"}],"subject":[],"published":{"date-parts":[[2023,5,1]]}}}