{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:55:09Z","timestamp":1773968109531,"version":"3.50.1"},"reference-count":43,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":212,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["1808085MF197"],"award-info":[{"award-number":["1808085MF197"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>The <jats:italic>K<\/jats:italic>\u2010means algorithm is one of the ten classic algorithms in the area of data mining and has been studied by researchers in numerous fields for a long time. However, the value of the clustering number <jats:italic>k<\/jats:italic> in the <jats:italic>K<\/jats:italic>\u2010means algorithm is not always easy to be determined, and the selection of the initial centers is vulnerable to outliers. This paper proposes an improved <jats:italic>K<\/jats:italic>\u2010means clustering algorithm called the covering <jats:italic>K<\/jats:italic>\u2010means algorithm (C\u2010<jats:italic>K<\/jats:italic>\u2010means). The C\u2010<jats:italic>K<\/jats:italic>\u2010means algorithm can not only acquire efficient and accurate clustering results but also self\u2010adaptively provide a reasonable numbers of clusters based on the data features. It includes two phases: the initialization of the covering algorithm (CA) and the Lloyd iteration of the <jats:italic>K<\/jats:italic>\u2010means<jats:italic>.<\/jats:italic> The first phase executes the CA. CA self\u2010organizes and recognizes the number of clusters <jats:italic>k<\/jats:italic> based on the similarities in the data, and it requires neither the number of clusters to be prespecified nor the initial centers to be manually selected. Therefore, it has a \u201cblind\u201d feature, that is, <jats:italic>k<\/jats:italic> is not preselected. The second phase performs the Lloyd iteration based on the results of the first phase. The C\u2010<jats:italic>K<\/jats:italic>\u2010means algorithm combines the advantages of CA and <jats:italic>K<\/jats:italic>\u2010means. Experiments are carried out on the Spark platform, and the results verify the good scalability of the C\u2010<jats:italic>K<\/jats:italic>\u2010means algorithm. This algorithm can effectively solve the problem of large\u2010scale data clustering. Extensive experiments on real data sets show that the accuracy and efficiency of the C\u2010<jats:italic>K<\/jats:italic>\u2010means algorithm outperforms the existing algorithms under both sequential and parallel conditions.<\/jats:p>","DOI":"10.1155\/2018\/7698274","type":"journal-article","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T23:40:48Z","timestamp":1533166848000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Self\u2010Adaptive <i>K<\/i>\u2010Means Based on a Covering Algorithm"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8709-1088","authenticated-orcid":false,"given":"Yiwen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8378-6296","authenticated-orcid":false,"given":"Yuanyuan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3022-178X","authenticated-orcid":false,"given":"Xing","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jintao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4151-8522","authenticated-orcid":false,"given":"Xiao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,8]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"publisher","DOI":"10.9790\/3021-0204719725"},{"key":"e_1_2_8_2_2","unstructured":"ShindlerM. WongA. andMeyersonA. W. Fast and accuratek-means for large datasets Proceedings of the 24th International Conference on Neural Information Processing Systems (NIPS\u201911) 2011 Granada Spain 2375\u20132383."},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2627527"},{"key":"e_1_2_8_4_2","unstructured":"ChenQ. ZhangX. WanY. ZobelJ. andVerspoorK. Sequence clustering methods and completeness of biological database search Proceedings of the Workshop on Advances in Bioinformatics and Artificial Intelligence: Bridging the Gap 2017 Melbourne VIC Australia 8\u201314."},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3131611"},{"key":"e_1_2_8_6_2","unstructured":"BottouL.andBengioY. Convergence properties of thek-means algorithms Proceedings of the 7th International Conference on Neural Information Processing Systems (NIPS\u201994) 1995 Denver CO USA 585\u2013592."},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.21728"},{"key":"e_1_2_8_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10665-1_71"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4109"},{"key":"e_1_2_8_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-014-1225-7"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395117"},{"key":"e_1_2_8_12_2","unstructured":"ArthurD.andVassilvitskiiS. k-means++: the advantages of careful seeding Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201807) 2007 New Orleans LA USA 1027\u20131035."},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"e_1_2_8_14_2","doi-asserted-by":"crossref","unstructured":"OrdonezC. Programming the K-means clustering algorithm in SQL Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD \u201804 2004 Seattle WA USA 823\u2013828 https:\/\/doi.org\/10.1145\/1014052.1016921.","DOI":"10.1145\/1014052.1016921"},{"key":"e_1_2_8_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.25"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46502-2_13"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(00)00131-8"},{"key":"e_1_2_8_18_2","unstructured":"MalkomesG. KusnerM. J. ChenW. WeinbergerK. Q. andMoseleyB. Fast distributedk-center clustering with outliers on massive data Proceedings of the 28th International Conference on Neural Information Processing Systems (NIPS\u201915) 2015 Montreal QC Canada 1063\u20131071."},{"key":"e_1_2_8_19_2","unstructured":"WeiD. A constant-factor bi-criteria approximation guarantee fork-means++ Proceedings of the 30th International Conference on Neural Information Processing Systems (NIPS\u201916) 2016 Barcelona Spain 604\u2013612."},{"key":"e_1_2_8_20_2","unstructured":"NewlingJ.andFleuretF. K-medoids for k-means seeding Proceedings of the International Conference on Neural Information Processing Systems (NIPS\u201917) 2017 Long Beach CA USA 5201\u20135209."},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/72.774263"},{"key":"e_1_2_8_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s005000050030"},{"key":"e_1_2_8_23_2","first-page":"287","article-title":"The quotient space theory of problem solving","volume":"59","author":"Zhang L.","year":"2004","journal-title":"Fundamenta Informaticae"},{"key":"e_1_2_8_24_2","unstructured":"RoyA.andPokuttaS. Hierarchical clustering via spreading metrics Proceedings of the 30th International Conference on Neural Information Processing Systems (NIPS\u201916) 2016 Barcelona Spain 2316\u20132324."},{"key":"e_1_2_8_25_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.20238"},{"key":"e_1_2_8_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41066-015-0011-0"},{"key":"e_1_2_8_27_2","first-page":"9","article-title":"Big data analysis: Apache Spark perspective","volume":"15","author":"Shoro A. G.","year":"2015","journal-title":"Global Journal of Computer Science and Technology"},{"key":"e_1_2_8_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-011-9340-1"},{"key":"e_1_2_8_29_2","doi-asserted-by":"crossref","unstructured":"PengS. SankaranarayananJ. andSametH. SPDO: high-throughput road distance computations on Spark using distance oracles 2016 IEEE 32nd International Conference on Data Engineering (ICDE) 2016 Helsinki Finland 1239\u20131250 https:\/\/doi.org\/10.1109\/ICDE.2016.7498328 2-s2.0-84980413888.","DOI":"10.1109\/ICDE.2016.7498328"},{"key":"e_1_2_8_30_2","unstructured":"AsuncionA.andNewmanD. UCI machine learning repository 2007 http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html."},{"key":"e_1_2_8_31_2","doi-asserted-by":"publisher","DOI":"10.1080\/10556780600834745"},{"key":"e_1_2_8_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.12.066"},{"key":"e_1_2_8_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.12.004"},{"key":"e_1_2_8_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.04.018"},{"key":"e_1_2_8_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.12.011"},{"key":"e_1_2_8_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766909"},{"key":"e_1_2_8_37_2","doi-asserted-by":"crossref","unstructured":"RuX. LiuZ. HuangZ. andJiangW. Class discovery based on k-means clustering and perturbation analysis 2015 8th International Congress on Image and Signal Processing (CISP) 2015 Shenyang China 1236\u20131240 https:\/\/doi.org\/10.1109\/CISP.2015.7408070 2-s2.0-84966669960.","DOI":"10.1109\/CISP.2015.7408070"},{"key":"e_1_2_8_38_2","doi-asserted-by":"crossref","unstructured":"WangB. YinJ. HuaQ. WuZ. andCaoJ. Parallelizing k-means-based clustering on Spark 2016 International Conference on Advanced Cloud and Big Data (CBD) 2016 Chengdu China 31\u201336 https:\/\/doi.org\/10.1109\/CBD.2016.016 2-s2.0-85013174039.","DOI":"10.1109\/CBD.2016.016"},{"key":"e_1_2_8_39_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2016\/09\/093403"},{"key":"e_1_2_8_40_2","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12100"},{"key":"e_1_2_8_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_2_8_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25660-3_17"},{"key":"e_1_2_8_43_2","doi-asserted-by":"crossref","unstructured":"MishraB. K. RathA. NayakN. R. andSwainS. Far efficient k-means clustering algorithm Proceedings of the International Conference on Advances in Computing Communications and Informatics - ICACCI \u201812 2012 Chennai India 106\u2013110 https:\/\/doi.org\/10.1145\/2345396.2345414 2-s2.0-84866083604.","DOI":"10.1145\/2345396.2345414"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/7698274.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/7698274.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/7698274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T23:07:05Z","timestamp":1723158425000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/7698274"}},"subtitle":[],"editor":[{"given":"Xiuzhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/7698274"],"URL":"https:\/\/doi.org\/10.1155\/2018\/7698274","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2017-12-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"7698274"}}