{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:35:29Z","timestamp":1787013329379,"version":"build-2736575974"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Natural Science Basic Research Program of Shaanxi","award":["2021JM-071"],"award-info":[{"award-number":["2021JM-071"]}]},{"name":"National Key Research and Development Program of China","award":["2018AAA0101902"],"award-info":[{"award-number":["2018AAA0101902"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772427"],"award-info":[{"award-number":["61772427"]}],"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":["61936014"],"award-info":[{"award-number":["61936014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["G2019KY0501"],"award-info":[{"award-number":["G2019KY0501"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tpami.2021.3085739","type":"journal-article","created":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T17:41:48Z","timestamp":1622569308000},"page":"1-1","source":"Crossref","is-referenced-by-count":56,"title":["Coordinate Descent Method for k-means"],"prefix":"10.1109","author":[{"given":"Feiping","family":"Nie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingjing","family":"Xue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danyang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hui","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuelong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2303095"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2018.2852289"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2616302"},{"key":"ref4","first-page":"1695","article-title":"Foreground clustering for joint segmentation and localization in videos and images,","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Sharma"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2017.2677578"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.88.018702"},{"key":"ref7","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm,","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Ng"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.70"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.277"},{"key":"ref10","first-page":"1874","article-title":"Subspace clustering via new low-rank model with discrete group structure constraint,","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Nie"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2944565"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2019.09.005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2020.3035677"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref16","article-title":"The hardness of $k$k-means clustering, Dept. Comput. Sci. Eng., Univ. California","volume-title":"Tech. Rep. CS2008\u20130916","author":"Dasgupta","year":"2008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(99)00069-0"},{"key":"ref19","first-page":"1027","article-title":"$k$k-means++: The advantages of careful seeding,","volume-title":"Proc. ACM-SIAM Symp. Discrete Algorithms","author":"Vassilvitskii"},{"key":"ref20","first-page":"91","article-title":"Refining initial points for $k$k-means clustering,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bradley"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.07.011"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10259"},{"key":"ref24","first-page":"147","article-title":"Using the triangle inequality to accelerate $k$k-means,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Elkan"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.12"},{"key":"ref26","first-page":"42","article-title":"Accelerated $k$k-means with adaptive distance bounds,","volume-title":"Proc. 5th NIPS Workshop Optim. Mach. Learn.","author":"Drake"},{"key":"ref27","first-page":"579","article-title":"Yinyang $k$k-means: A drop-in replacement of the classic $k$k-means with consistent speedup,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ding"},{"key":"ref28","first-page":"936","article-title":"Fast $k$k-means with accurate bounds,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Newling"},{"key":"ref29","first-page":"1352","article-title":"Nested mini-batch $k$k-means,","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Newling"},{"key":"ref30","first-page":"298","article-title":"Random projections for $k$k-means clustering,","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Boutsidis"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2375327"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746569"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91253-0_63"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10852"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993712"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.103"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1271-x"},{"key":"ref39","first-page":"3319","article-title":"Sparse embedded $k$k-means clustering,","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref40","first-page":"4691","article-title":"$k$k-means clustering using random matrix sparsification,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sinha"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312248"},{"key":"ref42","first-page":"727","article-title":"X-means: Extending $k$k-means with efficient estimation of the number of clusters,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Pelleg"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952605"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0892-3"},{"key":"ref46","volume-title":"Introductory Mathematical Statistics: Principles and Methods","author":"Kreyszig","year":"1970"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662063"},{"key":"ref49","article-title":"The art of clustering bandits,","author":"Li","year":"2016"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396767"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref52","first-page":"757","article-title":"Online clustering of bandits,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gentile"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/405"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911548"},{"key":"ref55","first-page":"1301","article-title":"Distributed clustering of linear bandits in peer to peer networks,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Korda"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392748"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2869688"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2664499"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2890017"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/09444882.pdf?arnumber=9444882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T18:27:58Z","timestamp":1704824878000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9444882\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":59,"URL":"https:\/\/doi.org\/10.1109\/tpami.2021.3085739","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}