{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:58:00Z","timestamp":1773773880784,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T00:00:00Z","timestamp":1600300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T00:00:00Z","timestamp":1600300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T00:00:00Z","timestamp":1600300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,9,17]]},"DOI":"10.1109\/idaacs-sws50031.2020.9297060","type":"proceedings-article","created":{"date-parts":[[2020,12,22]],"date-time":"2020-12-22T21:06:45Z","timestamp":1608671205000},"page":"1-5","source":"Crossref","is-referenced-by-count":26,"title":["An Improved K-means Clustering Algorithm"],"prefix":"10.1109","author":[{"given":"Hui","family":"Xu","sequence":"first","affiliation":[]},{"given":"Shunyu","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Qianyun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhiwei","family":"Ye","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"226","article-title":"A Density Based algorithm for discovering clusters in large spatial databases","author":"ester","year":"1996","journal-title":"Proc 1996 Int Conf Knowledge Discovery and Data Mining"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009745219419"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304187"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.03.011"},{"key":"ref14","first-page":"428","article-title":"WaveCluster: A multi-resolution clustering approach for very large spatial databases","author":"sheikholeslami","year":"1998","journal-title":"Proceedings of the 24rd International Conference on Very Large Data Bases (VLDB)"},{"key":"ref15","first-page":"40","article-title":"An improved initialization center k-means clustering algorithm based on distance and density","volume":"1955","author":"yanling","year":"2018","journal-title":"American Institute of Physics Conference Series"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1109\/TPAMI.2011.255","article-title":"Optimized data fusion for kernel kmeans clustering","volume":"34","author":"yu","year":"2012","journal-title":"IEEE Transactions on Pattern Analysis & Machine Intelligence"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.neucom.2018.06.058","article-title":"Constraint-based clustering by fast search and find of density peaks","volume":"330","author":"ruhui","year":"2019","journal-title":"Neurocomputing"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.03.031"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.079"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276314"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-4103-2_7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009769707641"},{"key":"ref7","first-page":"1","article-title":"Data mining: concepts and techniques","volume":"5","author":"han","year":"2006","journal-title":"Data Min Concepts Models Methods Algorithms Second Ed"},{"key":"ref2","first-page":"1","article-title":"A fast clustering algorithm to cluster very large categorical data sets in data mining","author":"zheyue","year":"1997","journal-title":"Research Issues on Data Mining and Knowledge Discovery"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/235968.233324","article-title":"BIRCH: an efficient data clustering method for very large databases","volume":"25","author":"tian","year":"1996","journal-title":"ACM SIGMOD Record"},{"key":"ref1","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"1","author":"macqueen","year":"1965","journal-title":"Proc Second Berkeley Symposium on Math Statist and Prob"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IDAACS.2013.6662661"}],"event":{"name":"2020 IEEE 5th International Symposium on Smart and Wireless Systems within the Conferences on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS)","location":"Dortmund, Germany","start":{"date-parts":[[2020,9,17]]},"end":{"date-parts":[[2020,9,18]]}},"container-title":["2020 IEEE 5th International Symposium on Smart and Wireless Systems within the Conferences on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9296930\/9297050\/09297060.pdf?arnumber=9297060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:07:29Z","timestamp":1656374849000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9297060\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,17]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/idaacs-sws50031.2020.9297060","relation":{},"subject":[],"published":{"date-parts":[[2020,9,17]]}}}