{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T15:04:08Z","timestamp":1773068648369,"version":"3.50.1"},"reference-count":25,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"vor","delay-in-days":96,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100010211","name":"Education Department of Jilin Province","doi-asserted-by":"publisher","award":["JJKH20191000K"],"award-info":[{"award-number":["JJKH20191000K"]}],"id":[{"id":"10.13039\/501100010211","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The KNN algorithm is one of the most famous algorithms in machine learning and data mining. It does not preprocess the data before classification, which leads to longer time and more errors. To solve the problems, this paper first proposes a PK\u2010means++ algorithm, which can better ensure the stability of a random experiment. Then, based on it and spherical region division, an improved KNN<jats:sup>PK+<\/jats:sup> is proposed. The algorithm can select the center of the spherical region appropriately and then construct an initial classifier for the training set to improve the accuracy and time of classification.<\/jats:p>","DOI":"10.1155\/2021\/5524388","type":"journal-article","created":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T00:35:34Z","timestamp":1617842134000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Improved KNN Algorithm Based on Preprocessing of Center in Smart Cities"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2815-0978","authenticated-orcid":false,"given":"Haiyan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Peidi","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Jinghua","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,4,7]]},"reference":[{"key":"e_1_2_11_1_2","first-page":"6","article-title":"Imbalanced K-NN classification method based on clustering","volume":"33","author":"Cui L.","year":"2020","journal-title":"Modern Computer"},{"key":"e_1_2_11_2_2","first-page":"1","article-title":"Review of K nearest neighbor algorithm theory and application","volume":"53","author":"Wu X.","year":"2017","journal-title":"Computer Engineering and Application"},{"key":"e_1_2_11_3_2","unstructured":"HuangX. An improved KNN algorithm and its application in real-time car-sharing prediction 2018 Dalian University of Technology Daian China M.S. thesis."},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"e_1_2_11_5_2","first-page":"1","article-title":"An optimization initial clustering center of K-means clustering algorithm","volume":"30","author":"Zhou A.","year":"2011","journal-title":"Microcomputer & Its Applications"},{"key":"e_1_2_11_6_2","doi-asserted-by":"crossref","unstructured":"JingY. GouH. andZhuY. An improved density-based method for reducing training data in KNN Proceedings of the International Conference on Computational and Information Sciences June 2013 Shiyang China 972\u2013975 https:\/\/doi.org\/10.1109\/ICCIS.2013.261 2-s2.0-84890882811.","DOI":"10.1109\/ICCIS.2013.261"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06538-0_5"},{"key":"e_1_2_11_8_2","first-page":"63","article-title":"Research on an improved parallel k-neighbor network public opinion classification algorithm","volume":"32","author":"Ma B.","year":"2015","journal-title":"Microelectronics & Computer"},{"key":"e_1_2_11_9_2","unstructured":"TianL. Research on KNN text classification algorithm 2016 Xi\u2019an University of Technology Xi\u2019an China M.S. thesis."},{"key":"e_1_2_11_10_2","unstructured":"HuJ. Improved KNN classification algorithm based on region division 2016 Qingdao University Qingdao China M.S. thesis."},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.37418\/amsj.9.7.27"},{"key":"e_1_2_11_12_2","doi-asserted-by":"publisher","DOI":"10.17577\/IJERTV9IS050303"},{"key":"e_1_2_11_13_2","doi-asserted-by":"publisher","DOI":"10.11591\/eei.v9i4.2348"},{"key":"e_1_2_11_14_2","unstructured":"BaoL. Applied research of hybrid genetic clustering algorithm in customer segmentation 2011 Jinan university. Guangzhou China M.S. thesis."},{"key":"e_1_2_11_15_2","first-page":"102","article-title":"Adaptive clustering algorithm based on maximum and minimum distances and SSE","volume":"35","author":"Cheng W.","year":"2015","journal-title":"Journal of Nanjing University of Posts and Telecommunications (Natural Science Edition)"},{"key":"e_1_2_11_16_2","doi-asserted-by":"crossref","unstructured":"GuL. A novel locality sensitive k-means clustering algorithm based on subtractive clustering Proceedings of the 7th IEEE International Conference on Software Engineering and Service Science (ICSESS) August 2016 Beijing China 836\u2013839 https:\/\/doi.org\/10.1109\/ICSESS.2016.7883196 2-s2.0-85016970547.","DOI":"10.1109\/ICSESS.2016.7883196"},{"key":"e_1_2_11_17_2","first-page":"21","article-title":"A k-means algorithm based on optimizing the initial clustering center and determining the k value","volume":"46","author":"Jiang L.","year":"2018","journal-title":"Computer & Digital Engineering"},{"key":"e_1_2_11_18_2","unstructured":"ArthurD.andVassilvitskiiS. k-means++: the advantages of careful seeding Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms January 2007 New Orleans LA USA 1027\u20131035."},{"key":"e_1_2_11_19_2","first-page":"96","article-title":"Research on improved BP neural network prediction by adaboost algorithm","volume":"35","author":"Li X.","year":"2013","journal-title":"Computer Engineering and Science"},{"key":"e_1_2_11_20_2","first-page":"151","article-title":"Analysis and research of clustering algorithm in data mining","volume":"2017","author":"Chen X.","year":"2017","journal-title":"Digital Technology & Application"},{"key":"e_1_2_11_21_2","first-page":"129","article-title":"Video summarization generation algorithm based on k-means++ clustering","volume":"30","author":"Zhang Y.","year":"2017","journal-title":"Industrial Control Computer"},{"key":"e_1_2_11_22_2","first-page":"1089","article-title":"Intrusion detection method for industrial control system with optimized support vector machine and k-means++","volume":"39","author":"Chen W.","year":"2019","journal-title":"Journal of Computer Applications"},{"key":"e_1_2_11_23_2","first-page":"181","article-title":"Research on wireless sensor networks clustering algorithm based on k-means++","volume":"34","author":"Yu X.","year":"2017","journal-title":"Application Research of Computers"},{"key":"e_1_2_11_24_2","first-page":"1431","article-title":"An optimized K-means++ algorithm guided by local probability","volume":"57","author":"Wang H.","year":"2019","journal-title":"Journal of Jilin University (Science Edition)"},{"key":"e_1_2_11_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2021.126305"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/5524388.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/5524388.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/5524388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:12:47Z","timestamp":1723241567000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/5524388"}},"subtitle":[],"editor":[{"given":"Zhihan","family":"Lv","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/5524388"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5524388","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5524388"}}