{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:24:15Z","timestamp":1758273855324,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T00:00:00Z","timestamp":1613692800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2016QY01W0200"],"award-info":[{"award-number":["2016QY01W0200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"publisher","award":["cstc2016jcyjA0407"],"award-info":[{"award-number":["cstc2016jcyjA0407"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant Nos. 61806030 & 61876027 & 61772096 & 61533020"],"award-info":[{"award-number":["Grant Nos. 61806030 & 61876027 & 61772096 & 61533020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,2,19]]},"DOI":"10.1145\/3459104.3459194","type":"proceedings-article","created":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T22:48:56Z","timestamp":1626821336000},"page":"551-555","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Fast k-means Clustering Based on the Neighbor Information"],"prefix":"10.1145","author":[{"given":"Daowan","family":"Peng","sequence":"first","affiliation":[{"name":"Chongqing University of Posts and Telecommunications, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zizhong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of California, Riverside, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingcheng","family":"Fu","sequence":"additional","affiliation":[{"name":"China General Technology Research Institute, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuyin","family":"Xia","sequence":"additional","affiliation":[{"name":"Chongqing University of Posts and Telecommunications, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Wen","sequence":"additional","affiliation":[{"name":"Chongqing University of Posts and Telecommunications, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Springer","author":"Wang Jingdong","year":"2015","unstructured":"Jingdong Wang , Jing Wang , Qifa Ke , Gang Zeng , and Shipeng Li . Fast approximate k-means via cluster closures. In Multimedia data mining and analytics, pages 373\u2013395 . Springer , 2015 . Jingdong Wang, Jing Wang, Qifa Ke, Gang Zeng, and Shipeng Li. Fast approximate k-means via cluster closures. In Multimedia data mining and analytics, pages 373\u2013395. Springer, 2015."},{"key":"e_1_3_2_1_2_1","first-page":"1035","volume-title":"Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms","author":"Arthur David","unstructured":"David Arthur and Sergei Vassilvitskii . k-means++ : The advantages of careful seeding . In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms , pages 1027\u2013 1035 . Society for Industrial and Applied Mathematics, 2007. David Arthur and Sergei Vassilvitskii. k-means++: The advantages of careful seeding. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pages 1027\u20131035. Society for Industrial and Applied Mathematics, 2007."},{"key":"e_1_3_2_1_3_1","first-page":"2586","volume-title":"International Conference on Machine Learning","author":"Bottesch Thomas","year":"2016","unstructured":"Thomas Bottesch , Thomas Bu\u00a8hler , and Markus K\u00a8achele . Speeding up k-means by approximating euclidean distances via block vectors . In International Conference on Machine Learning , pages 2578\u2013 2586 , 2016 . Thomas Bottesch, Thomas Bu\u00a8hler, and Markus K\u00a8achele. Speeding up k-means by approximating euclidean distances via block vectors. In International Conference on Machine Learning, pages 2578\u20132586, 2016."},{"key":"e_1_3_2_1_4_1","volume-title":"The hardness of k-means clustering. Department of Computer Science and Engineering","author":"Dasgupta Sanjoy","year":"2008","unstructured":"Sanjoy Dasgupta . The hardness of k-means clustering. Department of Computer Science and Engineering , University of California , 2008 . Sanjoy Dasgupta. The hardness of k-means clustering. Department of Computer Science and Engineering, University of California , 2008."},{"key":"e_1_3_2_1_5_1","first-page":"1223","volume-title":"2018 IEEE 34th International Conference on Data Engineering (ICDE)","author":"Deng Cheng-Hao","unstructured":"Cheng-Hao Deng and Wan-Lei Zhao . Fast k-means based on k-nn graph . In 2018 IEEE 34th International Conference on Data Engineering (ICDE) , pages 1220\u2013 1223 . IEEE, 2018. Cheng-Hao Deng and Wan-Lei Zhao. Fast k-means based on k-nn graph. In 2018 IEEE 34th International Conference on Data Engineering (ICDE), pages 1220\u20131223. IEEE, 2018."},{"key":"e_1_3_2_1_6_1","volume-title":"5th NIPS workshop on optimization for machine learning","volume":"8","author":"Drake Jonathan","year":"2012","unstructured":"Jonathan Drake and Greg Hamerly . Accelerated k-means with adaptive distance bounds . In 5th NIPS workshop on optimization for machine learning , volume 8 , 2012 . Jonathan Drake and Greg Hamerly. Accelerated k-means with adaptive distance bounds. In 5th NIPS workshop on optimization for machine learning, volume 8, 2012."},{"key":"e_1_3_2_1_7_1","first-page":"153","volume-title":"Proceedings of the 20th International Conference on Machine Learning (ICML-03)","author":"Elkan Charles","year":"2003","unstructured":"Charles Elkan . Using the triangle inequality to accelerate k-means . In Proceedings of the 20th International Conference on Machine Learning (ICML-03) , pages 147\u2013 153 , 2003 . Charles Elkan. Using the triangle inequality to accelerate k-means. In Proceedings of the 20th International Conference on Machine Learning (ICML-03), pages 147\u2013153, 2003."},{"key":"e_1_3_2_1_8_1","volume-title":"The elements of statistical learning","author":"Friedman Jerome","year":"2001","unstructured":"Jerome Friedman , Trevor Hastie , and Robert Tibshirani . The elements of statistical learning , volume 1 . Springer series in statistics New York, 2001 . Jerome Friedman, Trevor Hastie, and Robert Tibshirani. The elements of statistical learning, volume 1. Springer series in statistics New York, 2001."},{"key":"e_1_3_2_1_9_1","first-page":"140","volume-title":"Proceedings of the 2010 SIAM international conference on data mining","author":"Hamerly Greg","unstructured":"Greg Hamerly . Making k-means even faster . In Proceedings of the 2010 SIAM international conference on data mining , pages 130\u2013 140 . SIAM, 2010. Greg Hamerly. Making k-means even faster. In Proceedings of the 2010 SIAM international conference on data mining, pages 130\u2013140. SIAM, 2010."},{"key":"e_1_3_2_1_10_1","first-page":"288","volume-title":"Advances in neural information processing systems","author":"Hamerly Greg","year":"2004","unstructured":"Greg Hamerly and Charles Elkan . Learning the k in k-means . In Advances in neural information processing systems , pages 281\u2013 288 , 2004 . Greg Hamerly and Charles Elkan. Learning the k in k-means. In Advances in neural information processing systems, pages 281\u2013288, 2004."},{"key":"e_1_3_2_1_11_1","first-page":"2102","volume-title":"Fast k-means for large scale clustering","author":"Hu Qinghao","year":"2017","unstructured":"Qinghao Hu , Jiaxiang Wu , Lu Bai , Yifan Zhang , and Jian Cheng . Fast k-means for large scale clustering . pages 2099\u2013 2102 , 11 2017 . Qinghao Hu, Jiaxiang Wu, Lu Bai, Yifan Zhang, and Jian Cheng. Fast k-means for large scale clustering. pages 2099\u2013 2102, 11 2017."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56608-5_43"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_14_1","first-page":"285","volume-title":"International Workshop on Algorithms and Computation","author":"Mahajan Meena","unstructured":"Meena Mahajan , Prajakta Nimbhorkar , and Kasturi Varadarajan . The planar k-means problem is np-hard . In International Workshop on Algorithms and Computation , pages 274\u2013 285 . Springer, 2009. Meena Mahajan, Prajakta Nimbhorkar, and Kasturi Varadarajan. The planar k-means problem is np-hard. In International Workshop on Algorithms and Computation, pages 274\u2013285. Springer, 2009."},{"key":"e_1_3_2_1_15_1","first-page":"944","volume-title":"International Conference on Machine Learning","author":"Newling James","year":"2016","unstructured":"James Newling and Fran\u00b8cois Fleuret . Fast k-means with accurate bounds . In International Conference on Machine Learning , pages 936\u2013 944 , 2016 . James Newling and Fran\u00b8cois Fleuret. Fast k-means with accurate bounds. In International Conference on Machine Learning, pages 936\u2013944, 2016."},{"key":"e_1_3_2_1_16_1","first-page":"1360","volume-title":"Advances in Neural Information Processing Systems","author":"Newling James","year":"2016","unstructured":"James Newling and Fran\u00b8cois Fleuret . Nested mini-batch k-means . In Advances in Neural Information Processing Systems , pages 1352\u2013 1360 , 2016 . James Newling and Fran\u00b8cois Fleuret. Nested mini-batch k-means. In Advances in Neural Information Processing Systems, pages 1352\u20131360, 2016."},{"key":"e_1_3_2_1_17_1","first-page":"154","volume-title":"International Conference on Machine Learning","author":"Nock Richard","year":"2016","unstructured":"Richard Nock , Rapha\u00a8el Canyasse , Roksana Boreli , and Frank Nielsen . k-variates++ : more pluses in the k-means++ . In International Conference on Machine Learning , pages 145\u2013 154 , 2016 . Richard Nock, Rapha\u00a8el Canyasse, Roksana Boreli, and Frank Nielsen. k-variates++: more pluses in the k-means++. In International Conference on Machine Learning, pages 145\u2013 154, 2016."},{"key":"e_1_3_2_1_18_1","volume-title":"Extending k-means with efficient estimation of the number of clusters in icml","author":"Pelleg D","year":"2000","unstructured":"D Pelleg . Extending k-means with efficient estimation of the number of clusters in icml . 2000 . D Pelleg. Extending k-means with efficient estimation of the number of clusters in icml. 2000."},{"key":"e_1_3_2_1_19_1","first-page":"1178","volume-title":"Proceedings of the 19th international conference on World wide web","author":"Sculley David","unstructured":"David Sculley . Web-scale k-means clustering . In Proceedings of the 19th international conference on World wide web , pages 1177\u2013 1178 . ACM, 2010. David Sculley. Web-scale k-means clustering. In Proceedings of the 19th international conference on World wide web, pages 1177\u20131178. ACM, 2010."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298483.3298603"},{"key":"e_1_3_2_1_21_1","first-page":"2383","volume-title":"Advances in neural information processing systems","author":"Shindler Michael","year":"2011","unstructured":"Michael Shindler , Alex Wong , and Adam W Meyerson . Fast and accurate k-means for large datasets . In Advances in neural information processing systems , pages 2375\u2013 2383 , 2011 . Michael Shindler, Alex Wong, and Adam W Meyerson. Fast and accurate k-means for large datasets. In Advances in neural information processing systems, pages 2375\u20132383, 2011."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.015"},{"key":"e_1_3_2_1_23_1","volume-title":"The hardness of k-means clustering in the plane. Manuscript, accessible at http:\/\/cseweb. ucsd. edu\/avattani\/papers\/kmeans hardness. pdf, 617","author":"Vattani Andrea","year":"2009","unstructured":"Andrea Vattani . The hardness of k-means clustering in the plane. Manuscript, accessible at http:\/\/cseweb. ucsd. edu\/avattani\/papers\/kmeans hardness. pdf, 617 , 2009 . Andrea Vattani. The hardness of k-means clustering in the plane. Manuscript, accessible at http:\/\/cseweb. ucsd. edu\/avattani\/papers\/kmeans hardness. pdf, 617, 2009."},{"key":"e_1_3_2_1_24_1","volume-title":"Fast k-means clustering with anderson acceleration. arXiv preprint arXiv:1805.10638","author":"Zhang Juyong","year":"2018","unstructured":"Juyong Zhang , Yuxin Yao , Yue Peng , Hao Yu , and Bailin Deng . Fast k-means clustering with anderson acceleration. arXiv preprint arXiv:1805.10638 , 2018 . Juyong Zhang, Yuxin Yao, Yue Peng, Hao Yu, and Bailin Deng. Fast k-means clustering with anderson acceleration. arXiv preprint arXiv:1805.10638, 2018."}],"event":{"name":"ISEEIE 2021: 2021 International Symposium on Electrical, Electronics and Information Engineering","acronym":"ISEEIE 2021","location":"Seoul Republic of Korea"},"container-title":["2021 International Symposium on Electrical, Electronics and Information Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3459104.3459194","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3459104.3459194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:10Z","timestamp":1750268950000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3459104.3459194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,19]]},"references-count":24,"alternative-id":["10.1145\/3459104.3459194","10.1145\/3459104"],"URL":"https:\/\/doi.org\/10.1145\/3459104.3459194","relation":{},"subject":[],"published":{"date-parts":[[2021,2,19]]},"assertion":[{"value":"2021-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}