{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:11:18Z","timestamp":1781086278934,"version":"3.54.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"publisher","award":["cstc2019jcyj-msxmX0485 and cstc2019jcyj-cxttX0002"],"award-info":[{"award-number":["cstc2019jcyj-msxmX0485 and cstc2019jcyj-cxttX0002"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2019QY(Y)0301 and 2016QY01W0200"],"award-info":[{"award-number":["2019QY(Y)0301 and 2016QY01W0200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61806030& 61876027&61772096&61533020"],"award-info":[{"award-number":["61806030& 61876027&61772096&61533020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NICE: NRT for Integrated Computational Entomology US NSF award","award":["1631776"],"award-info":[{"award-number":["1631776"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tpami.2020.3008694","type":"journal-article","created":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T22:22:52Z","timestamp":1594678972000},"page":"1-1","source":"Crossref","is-referenced-by-count":120,"title":["A Fast Adaptive k-means with No Bounds"],"prefix":"10.1109","author":[{"given":"Shuyin","family":"Xia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daowan","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deyu","family":"Meng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guoyin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elisabeth","family":"Giem","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zizhong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"ref2","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":"ref3","article-title":"UCI machine learning repository","author":"Dheeru","year":"2017","journal-title":"School Inform. Comput. Sci."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10259"},{"key":"ref5","first-page":"55","article-title":"Fast and provably good seedings for k-means","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Bachem"},{"key":"ref6","first-page":"91","article-title":"Refining initial points for K-means clustering","volume-title":"Proc. 15th Int. Conf. Mach. Learn.","author":"Bradley"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.34"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00115"},{"key":"ref9","first-page":"579","article-title":"Yinyang K-means: A drop-in replacement of the classic k-means with consistent speedup","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ding"},{"key":"ref10","article-title":"Faster k-means clustering","author":"Jonathan","year":"2013"},{"key":"ref11","first-page":"147","article-title":"Using the triangle inequality to accelerate k-means","volume-title":"Proc. 20th Int. Conf. Mach. Learn.","author":"Elkan"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1631\/jzus.2006.A1626"},{"issue":"12","key":"ref13","first-page":"4743","article-title":"K-means properties on six clustering benchmark datasets","volume-title":"Appl. Intell.","volume":"48","author":"Fr\u00e4nti","year":"2018"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.12"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09259-1_2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133091"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1071\/BT9660127"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56608-5_43"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401946"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref22","first-page":"936","article-title":"Fast k-means with accurate bounds","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Newling"},{"key":"ref23","first-page":"5195","article-title":"K-medoids for k-means seeding","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Newling"},{"key":"ref24","first-page":"144","article-title":"Efficient and effective clustering methods for spatial data mining","volume-title":"Proc. 20th Int. Conf. Very Large Data Bases","author":"Ng"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.5772\/intechopen.85447"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312248"},{"issue":"2","key":"ref28","first-page":"3","article-title":"A-means: Improving the cluster assignment phase of k-means for big data","volume":"9","author":"Ortega","year":"2018","journal-title":"Int. J. Combinatorial Optim. Problems Inform."},{"issue":"2","key":"ref29","first-page":"94","article-title":"Early classification: A new heuristic to improve the classification step of k-means","volume":"4","author":"P\u00e9rez","year":"2013","journal-title":"J. Inf. Data Manage."},{"issue":"8","key":"ref30","first-page":"873","article-title":"Kissing numbers, sphere packings, and some unexpected proofs","volume":"51","author":"Pfender","year":"2004","journal-title":"Notices AMS"},{"issue":"3","key":"ref31","first-page":"E70","article-title":"Scalable object retrieval in very large image collections","volume":"93","author":"Philbin","year":"2010","journal-title":"Annales De Zoologie Ecologie Animale"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383172"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.37"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772862"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2007.4413608"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/11494669_93"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248034"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref39","article-title":"The Anchors Hierachy: Using the triangle inequality to survive high dimensional data","author":"Andrew","year":"2013"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.01.010"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/09139397.pdf?arnumber=9139397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:34:25Z","timestamp":1704839665000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9139397\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/tpami.2020.3008694","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":[[2020]]}}}