{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T12:44:09Z","timestamp":1780317849284,"version":"3.54.1"},"reference-count":35,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T00:00:00Z","timestamp":1614729600000},"content-version":"vor","delay-in-days":61,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2018QF002"],"award-info":[{"award-number":["ZR2018QF002"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p><jats:italic>k<\/jats:italic> nearest neighbor (<jats:italic>k<\/jats:italic>NN) is a simple and widely used classifier; it can achieve comparable performance with more complex classifiers including decision tree and artificial neural network. Therefore, <jats:italic>k<\/jats:italic>NN has been listed as one of the top 10 algorithms in machine learning and data mining. On the other hand, in many classification problems, such as medical diagnosis and intrusion detection, the collected training sets are usually class imbalanced. In class imbalanced data, although positive examples are heavily outnumbered by negative ones, positive examples usually carry more meaningful information and are more important than negative examples. Similar to other classical classifiers, <jats:italic>k<\/jats:italic>NN is also proposed under the assumption that the training set has approximately balanced class distribution, leading to its unsatisfactory performance on imbalanced data. In addition, under a class imbalanced scenario, the global resampling strategies that are suitable to decision tree and artificial neural network often do not work well for <jats:italic>k<\/jats:italic>NN, which is a local information\u2010oriented classifier. To solve this problem, researchers have conducted many works for <jats:italic>k<\/jats:italic>NN over the past decade. This paper presents a comprehensive survey of these works according to their different perspectives and analyzes and compares their characteristics. At last, several future directions are pointed out.<\/jats:p>","DOI":"10.1155\/2021\/5520990","type":"journal-article","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T02:20:08Z","timestamp":1614824408000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["A Survey of <i>k<\/i> Nearest Neighbor Algorithms for Solving the Class Imbalanced Problem"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2142-8869","authenticated-orcid":false,"given":"Bo","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8565-6417","authenticated-orcid":false,"given":"Haiyan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2021,3,3]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-45528-0"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2018.11.006"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.04.075"},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.107150"},{"key":"e_1_2_11_5_2","first-page":"1","article-title":"Nearest neighbor with double neighborhoods algorithms for imbalanced data","volume":"50","author":"Wang C. W.","year":"2018","journal-title":"International Journal of Applied Mathematics"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.10.038"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.06.009"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.10.044"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.02.039"},{"key":"e_1_2_11_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artmed.2013.03.007"},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.03.006"},{"key":"e_1_2_11_12_2","doi-asserted-by":"crossref","unstructured":"DubeyH.andPudiV. Class based weighted k-nearest neighbor over imbalance dataset Proceedings of the Pacific-asia Conference on Knowledge Discovery and Data Mining 2013 Berlin 305\u2013316.","DOI":"10.1007\/978-3-642-37456-2_26"},{"key":"e_1_2_11_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105662"},{"key":"e_1_2_11_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-6602-3_3"},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12495"},{"key":"e_1_2_11_16_2","doi-asserted-by":"crossref","unstructured":"SongY. HuangJ. ZhouD. ZhaH. andGilesC. L. IKNN: informative k-nearest neighbor pattern classification Proceedings of the European Conference on Principles of Data Mining and Knowledge Discovery 2007 Berlin 248\u2013264.","DOI":"10.1007\/978-3-540-74976-9_25"},{"key":"e_1_2_11_17_2","doi-asserted-by":"crossref","unstructured":"LiuW.andChawlaS. Class confidence weighted kNN algorithms for imbalanced data sets Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining 2011 Berlin 345\u2013356.","DOI":"10.1007\/978-3-642-20847-8_29"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0846-3"},{"key":"e_1_2_11_19_2","unstructured":"PatelH.andThakurG. S. A hybrid weighted nearest neighbor approach to mine imbalanced data Proceedings of the 12th International Conference on Data Mining 2016 Athens 106\u2013110."},{"key":"e_1_2_11_20_2","doi-asserted-by":"crossref","unstructured":"KrimingerE. PrincipeJ. C. andLakshminarayanC. Nearest neighbor distributions for imbalanced classification Proceedings of The 2012 International joint conference on neural networks (IJCNN) 2012 Brisbane 1\u20135.","DOI":"10.1109\/IJCNN.2012.6252718"},{"key":"e_1_2_11_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.03.008"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.22266\/ijies2017.0228.07"},{"key":"e_1_2_11_23_2","doi-asserted-by":"publisher","DOI":"10.1080\/03772063.2018.1462109"},{"key":"e_1_2_11_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2017.2754998"},{"key":"e_1_2_11_25_2","first-page":"2850","article-title":"Evolutionary cluster-based synthetic oversampling ensemble (ECO-Ensemble) for imbalance learning","volume":"47","author":"Lim P.","year":"2017","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"e_1_2_11_26_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.953"},{"key":"e_1_2_11_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.232"},{"key":"e_1_2_11_28_2","doi-asserted-by":"crossref","unstructured":"LiY. X.andZhangX. Z. Improving k nearest neighbor with exemplar generalization for imbalanced classification Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining 2011 Berlin https:\/\/doi.org\/10.1007\/978-3-642-20847-8_27.","DOI":"10.1007\/978-3-642-20847-8_27"},{"key":"e_1_2_11_29_2","doi-asserted-by":"publisher","DOI":"10.7763\/IJCCE.2014.V3.296"},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.239"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37456-2_25"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.08.023"},{"key":"e_1_2_11_33_2","doi-asserted-by":"crossref","unstructured":"NikpourB. ShabaniM. andNezamabadi-pourH. Proposing new method to improve gravitational fixed nearest neighbor algorithm for imbalanced data classification 2017 2nd Conference on Swarm Intelligence and Evolutionary Computation (CSIEC) March 2017 Kerman 6\u201311 https:\/\/doi.org\/10.1109\/CSIEC.2017.7940167 2-s2.0-85021435336.","DOI":"10.1109\/CSIEC.2017.7940167"},{"key":"e_1_2_11_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.09.015"},{"key":"e_1_2_11_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105474"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/5520990.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/5520990.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/5520990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T09:23:00Z","timestamp":1723022580000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/5520990"}},"subtitle":[],"editor":[{"given":"Junwu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/5520990"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5520990","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"value":"1530-8669","type":"print"},{"value":"1530-8677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-01-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5520990"}}