{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:50:57Z","timestamp":1766602257739,"version":"3.48.0"},"reference-count":85,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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. Inform. Theory"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1109\/tit.2025.3628160","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T18:44:25Z","timestamp":1762195465000},"page":"478-500","source":"Crossref","is-referenced-by-count":0,"title":["Adversarially Robust Clustering With Optimality Guarantees"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7547-9333","authenticated-orcid":false,"given":"Soham","family":"Jana","sequence":"first","affiliation":[{"name":"Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre Dame, IN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2145-596X","authenticated-orcid":false,"given":"Kun","family":"Yang","sequence":"additional","affiliation":[{"name":"O’Donnell Data Science and Research Computing Institute, Southern Methodist University, Dallas, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5308-5250","authenticated-orcid":false,"given":"Sanjeev","family":"Kulkarni","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering and the Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"issue":"14","key":"ref2","doi-asserted-by":"crossref","first-page":"2826","DOI":"10.1016\/j.comcom.2007.05.024","article-title":"A survey on clustering algorithms for wireless sensor networks","volume":"30","author":"Abbasi","year":"2007","journal-title":"Comput. Commun."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CICN.2012.136"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1139\/f98-176"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.98.258101"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SSIAI.2006.1633722"},{"issue":"6","key":"ref7","first-page":"2225","article-title":"Fuzzy kc-means clustering algorithm for medical image segmentation","volume":"2","author":"Funmilola","year":"2012","journal-title":"J. Inf. Eng. Appl."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/KAM.2010.5646274"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/91.580801"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(02)00280-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-010-0064-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(91)90002-4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZY.1993.327577"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/34.85669"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/91.227387"},{"key":"ref17","article-title":"Center based clustering: A foundational perspective","volume-title":"Handbook of Cluster Analysis","author":"Awasthi","year":"2015"},{"key":"ref18","article-title":"Fast distributed k-center clustering with outliers on massive data","volume-title":"Proc. Adv. Neural Inf. Process. Syst","volume":"28","author":"Malkomes"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45771-6_5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.09.050"},{"key":"ref21","article-title":"Statistical and computational guarantees of Lloyd\u2019s algorithm and its variants","author":"Lu","year":"2016","journal-title":"arXiv:1612.02099"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2317"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/sta4.505"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316350"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/jrsssb\/qkaf041"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00023"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/22-AOS2196"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.10.006"},{"key":"ref29","first-page":"642","article-title":"Algorithms for facility location problems with outliers","volume-title":"Proc. SODA","author":"Charikar"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/RoboMech.2017.8261116"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067425"},{"key":"ref32","first-page":"322","article-title":"Differentially private clustering in high-dimensional Euclidean spaces","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Balcan"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(86)80015-3"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897647"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347386"},{"key":"ref36","first-page":"355","article-title":"Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum","volume":"43","author":"Weiszfeld","year":"1937","journal-title":"Tohoku Math. J."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703266"},{"key":"ref38","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin"},{"issue":"3","key":"ref39","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.patrec.2003.10.016","article-title":"Clustering of interval data based on city\u2013block distances","volume":"25","author":"de Souza","year":"2004","journal-title":"Pattern Recognit. Lett."},{"key":"ref40","first-page":"368","article-title":"Clustering via concave minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"9","author":"Bradley"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.008"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.7"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1894.0003"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.2307\/2334652"},{"key":"ref45","first-page":"1","article-title":"A method of moments for mixture models and hidden Markov models","volume-title":"Proc. Conf. Learn. Theory","author":"Anandkumar"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1214\/22-aos2207"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.15"},{"key":"ref48","first-page":"407","article-title":"Toward learning Gaussian mixtures with arbitrary separation","volume-title":"Proc. COLT","author":"Belkin"},{"issue":"7","key":"ref49","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":"ref50","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS2044"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.52202\/079017-3610"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1031833664"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098156"},{"article-title":"Understanding regularized spectral clustering via graph conductance","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang","key":"ref54"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1607"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7152(99)00067-X"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1996.10476954"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-96-03657-X"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801"},{"article-title":"Clustering by means of medoids","volume-title":"Proc. Stat. Data Anal. Based L1 Norm Conf.","author":"Rousseeuw","key":"ref60"},{"key":"ref61","article-title":"New bounds for k-means and information k-means","author":"Appert","year":"2021","journal-title":"arXiv:2101.05728"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS2033"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2021.107370"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699803"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4380-9_35"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1214\/20-aos1961"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1137\/17M1126680"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/3583680"},{"key":"ref69","first-page":"1649","article-title":"How hard is robust mean estimation","volume-title":"Proc. Conf. Learn. theory","author":"Hopkins"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014118"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2414422"},{"issue":"86","key":"ref72","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Van der Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/323233.323264"},{"key":"ref74","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52055-4","volume-title":"Concrete and Abstract Voronoi Diagrams","volume":"400","author":"Klein","year":"1989"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1214\/17-aos1615"},{"key":"ref76","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":"ref77","first-page":"799","article-title":"Robust k-means++","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Deshpande"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3585804"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"article-title":"Letter recognition","year":"1991","author":"Slate","key":"ref80"},{"article-title":"Pen-based recognition of handwritten digits","year":"1998","author":"Alpaydin","key":"ref81"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4409061"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v17-2079"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11313721\/11224395.pdf?arnumber=11224395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:45:29Z","timestamp":1766601929000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11224395\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":85,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3628160","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2026,1]]}}}