{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:42:34Z","timestamp":1746438154112,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"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":[],"published-print":{"date-parts":[[2022,5,23]]},"DOI":"10.1109\/icassp43922.2022.9746288","type":"proceedings-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T19:50:34Z","timestamp":1651089034000},"page":"4433-4437","source":"Crossref","is-referenced-by-count":1,"title":["No More Than 6ft Apart: Robust K-Means via Radius Upper Bounds"],"prefix":"10.1109","author":[{"given":"Ahmed","family":"Imtiaz Humayun","sequence":"first","affiliation":[{"name":"Rice University"}]},{"given":"Randall","family":"Balestriero","sequence":"additional","affiliation":[{"name":"Meta AI Research"}]},{"given":"Anastasios","family":"Kyrillidis","sequence":"additional","affiliation":[{"name":"Rice University"}]},{"given":"Richard","family":"Baraniuk","sequence":"additional","affiliation":[{"name":"Rice University"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/2670010"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2009.2036603"},{"article-title":"Robust trimmed k-means","year":"2021","author":"dorabiala","key":"ref12"},{"key":"ref13","article-title":"Constrained k-means clustering","volume":"20","author":"bradley","year":"2000"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/17M1150670"},{"key":"ref15","first-page":"3120","article-title":"tk-means: A robust and stable k-means variant","author":"li","year":"2021","journal-title":"ICASSP"},{"key":"ref16","first-page":"1057","article-title":"Spectral relaxation for k-means clustering","author":"zha","year":"2001","journal-title":"NeurIPS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"ref18","article-title":"Diameter-constrained clustering: Algorithms and experiments for a layout coverage problem","author":"zhong","year":"2006","journal-title":"7th Annual Austin CAS Conference"},{"key":"ref19","volume":"4","author":"zhang","year":"2006","journal-title":"The Schur Complement and Its Applications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2092-1_38"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N19-3002"},{"key":"ref6","first-page":"3448","article-title":"Fair k-center clustering for data summarization","author":"kleindessner","year":"2019","journal-title":"ICML"},{"key":"ref5","first-page":"1877","article-title":"How to solve fair k-center in massive data models","author":"chiplunkar","year":"2020","journal-title":"ICML"},{"article-title":"Fair clustering through fairlets","year":"2018","author":"chierichetti","key":"ref8"},{"article-title":"Fair algorithms for clustering","year":"2019","author":"bera","key":"ref7"},{"key":"ref2","first-page":"77","article-title":"Gender shades: Intersectional accuracy disparities in commercial gender classification","author":"buolamwini","year":"2018","journal-title":"Conference on Fairness Accountability and Transparency"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-017-9514-0"},{"key":"ref9","article-title":"Imbalanced k-means: An algorithm to cluster imbalanced-distributed data","volume":"2","author":"santhosh kumar","year":"2014","journal-title":"International Journal of Engineering Research and Technology"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800090303"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1322081"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"event":{"name":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2022,5,23]]},"location":"Singapore, Singapore","end":{"date-parts":[[2022,5,27]]}},"container-title":["ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9745891\/9746004\/09746288.pdf?arnumber=9746288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T20:10:38Z","timestamp":1660594238000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9746288\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icassp43922.2022.9746288","relation":{},"subject":[],"published":{"date-parts":[[2022,5,23]]}}}