{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T23:04:01Z","timestamp":1779231841805,"version":"3.51.4"},"reference-count":148,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:00:00Z","timestamp":1723334400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:00:00Z","timestamp":1723334400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Air Force Office of Scientific Research under","award":["FA2386-23-1-4003"],"award-info":[{"award-number":["FA2386-23-1-4003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The k-Nearest Neighbors (kNN) method, established in 1951, has since evolved into a pivotal tool in data mining, recommendation systems, and Internet of Things (IoT), among other areas. This paper presents a comprehensive review and performance analysis of modifications made to enhance the exact kNN techniques, particularly focusing on kNN Search and kNN Join for high-dimensional data. We delve deep into 31 kNN search methods and 12 kNN join methods, providing a methodological overview and analytical insight into each, emphasizing their strengths, limitations, and applicability. An important feature of our study is the provision of the source code for each of the kNN methods discussed, fostering ease of experimentation and comparative analysis for readers. Motivated by the rising significance of kNN in high-dimensional spaces and a recognized gap in comprehensive surveys on exact kNN techniques, our work seeks to bridge this gap. Additionally, we outline existing challenges and present potential directions for future research in the domain of kNN techniques, offering a holistic guide that amalgamates, compares, and dissects existing methodologies in a coherent manner.<\/jats:p>\n                <jats:p><jats:bold>Graphical Abstract<\/jats:bold><\/jats:p>","DOI":"10.1186\/s40537-024-00973-y","type":"journal-article","created":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T08:02:10Z","timestamp":1723363330000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":407,"title":["Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications"],"prefix":"10.1186","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8542-2258","authenticated-orcid":false,"given":"Rajib Kumar","family":"Halder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0365-294X","authenticated-orcid":false,"given":"Mohammed Nasir","family":"Uddin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4316-4975","authenticated-orcid":false,"given":"Md. Ashraf","family":"Uddin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6639-6824","authenticated-orcid":false,"given":"Sunil","family":"Aryal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8623-0987","authenticated-orcid":false,"given":"Ansam","family":"Khraisat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,11]]},"reference":[{"key":"973_CR1","unstructured":"Wikipedia contributors. K-nearest neighbors algorithm. 2023. https:\/\/en.wikipedia.org\/wiki\/K-nearest_neighbors_algorithm."},{"key":"973_CR2","doi-asserted-by":"publisher","unstructured":"Andoni A, Indyk P. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), Berkeley, CA, USA, 2006. https:\/\/doi.org\/10.1109\/focs.2006.49.","DOI":"10.1109\/focs.2006.49"},{"key":"973_CR3","doi-asserted-by":"publisher","unstructured":"Bawa M, Condie T, Ganesan P. LSH forest. In Proceedings of the 14th International Conference on World Wide Web (WWW \u201805). 2005. https:\/\/doi.org\/10.1145\/1060745.1060840","DOI":"10.1145\/1060745.1060840"},{"key":"973_CR4","unstructured":"Lv Q, Josephson W, Wang Z, Charikar M, Li K. Multi-probe LSH: efficient indexing for high-dimensional similarity search. In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB \u201807), 2007. 950\u2013961. https:\/\/www.csd.uoc.gr\/~hy561\/Data\/Papers\/p950-lv.pdf."},{"issue":"1","key":"973_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/tpami.2010.57","volume":"33","author":"H Je\u01f5ou","year":"2011","unstructured":"Je\u01f5ou H, Douze M, Schmid C. Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell. 2011;33(1):117\u201328. https:\/\/doi.org\/10.1109\/tpami.2010.57.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"973_CR6","doi-asserted-by":"publisher","first-page":"37059","DOI":"10.1109\/access.2019.2900730","volume":"7","author":"Y Wang","year":"2019","unstructured":"Wang Y, Pan Z, Li R. A new Cell-Level search based Non-Exhaustive Approximate Nearest Neighbor (ANN) search algorithm in the framework of product quantization. IEEE Access. 2019;7:37059\u201370. https:\/\/doi.org\/10.1109\/access.2019.2900730.","journal-title":"IEEE Access"},{"key":"973_CR7","doi-asserted-by":"publisher","unstructured":"B\u00f6hm C, Krebs F. Supporting KDD applications by the K-Nearest Neighbor join. In Lecture Notes in Computer Science. 2003. pp. 504\u2013516. https:\/\/doi.org\/10.1007\/978-3-540-45227-0_50.","DOI":"10.1007\/978-3-540-45227-0_50"},{"issue":"6","key":"973_CR8","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm C, Krebs F. The K-Nearest neighbour join: turbo charging the KDD process. Knowl Inf Syst. 2004;6(6):728\u201349. https:\/\/doi.org\/10.1007\/s10115-003-0122-9.","journal-title":"Knowl Inf Syst"},{"key":"973_CR9","unstructured":"Algorithm AS 136: A K-Means Clustering Algorithm\u2014\u767e\u5ea6\u5b66\u672f. (n.d.). https:\/\/xueshu.baidu.com\/usercenter\/paper\/show?paperid=2815fe2e7eaf7485735d130eac76d330."},{"issue":"7","key":"973_CR10","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/tpami.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo T, Mount DM, Netanyahu NS, Piatko CD, Silverman R, Wu AY. An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans Pattern Anal Mach Intell. 2002;24(7):881\u201392. https:\/\/doi.org\/10.1109\/tpami.2002.1017616.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"973_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/335191.335388","volume":"29","author":"M Breunig","year":"2000","unstructured":"Breunig M, Kriegel H, Ng RT, Sander J. LOF. Sigmod Record. 2000;29(2):93\u2013104. https:\/\/doi.org\/10.1145\/335191.335388.","journal-title":"Sigmod Record"},{"issue":"10","key":"973_CR12","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.14778\/2336664.2336674","volume":"5","author":"W L\u00fc","year":"2012","unstructured":"L\u00fc W, Shen Y, Su C, Ooi BC. Efficient processing of k nearest neighbor joins using MapReduce. Proc VLDB Endowment. 2012;5(10):1016\u201327. https:\/\/doi.org\/10.14778\/2336664.2336674.","journal-title":"Proc VLDB Endowment"},{"key":"973_CR13","unstructured":"Dasarathy BV. Nearest neighbor (NN) norms: NN pattern classification techniques. 1991. http:\/\/ci.nii.ac.jp\/ncid\/BA19940413."},{"issue":"5","key":"973_CR14","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1109\/tnnls.2017.2673241","volume":"29","author":"S Zhang","year":"2018","unstructured":"Zhang S, Li X, Zong M, Zhu X, Wang R. Efficient KNN classification with different numbers of nearest neighbors. IEEE Trans Neural Netw Learn Syst. 2018;29(5):1774\u201385. https:\/\/doi.org\/10.1109\/tnnls.2017.2673241.","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"2","key":"973_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A Guttman","year":"1984","unstructured":"Guttman A. R-Trees. Sigmod Record. 1984;14(2):47\u201357. https:\/\/doi.org\/10.1145\/971697.602266.","journal-title":"Sigmod Record"},{"key":"973_CR16","doi-asserted-by":"publisher","unstructured":"Beckmann N, Kriegel H, Schneider R, Seeger B. The R*-tree: an efficient and robust access method for points and rectangles. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201890). 1990. https:\/\/doi.org\/10.1145\/93597.98741.","DOI":"10.1145\/93597.98741"},{"key":"973_CR17","unstructured":"Kamel I, Faloutsos C. Hilbert R-tree: An Improved R-tree using Fractals. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB \u201894), 1994. 500\u2013509. http:\/\/cis.temple.edu\/~vasilis\/Courses\/CIS750\/Papers\/HilbertRtree-Kamel.pdf."},{"issue":"1","key":"973_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1328911.1328920","volume":"4","author":"L Arge","year":"2008","unstructured":"Arge L, De Berg M, Haverkort H, Yi K. The priority R-tree. ACM Trans Algorithms. 2008;4(1):1\u201330. https:\/\/doi.org\/10.1145\/1328911.1328920.","journal-title":"ACM Trans Algorithms"},{"issue":"1\u20136","key":"973_CR19","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/bf01759061","volume":"6","author":"RF Sproull","year":"1991","unstructured":"Sproull RF. Refinements to nearest-neighbor searching ink-dimensional trees. Algorithmica. 1991;6(1\u20136):579\u201389. https:\/\/doi.org\/10.1007\/bf01759061.","journal-title":"Algorithmica"},{"issue":"7","key":"973_CR20","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/t-c.1975.224297","volume":"C-24","author":"K Fukunaga","year":"1975","unstructured":"Fukunaga K, Narendra PM. A branch and bound algorithm for computing K-Nearest neighbors. IEEE Trans Comput. 1975;C\u201324(7):750\u20133. https:\/\/doi.org\/10.1109\/t-c.1975.224297.","journal-title":"IEEE Trans Comput"},{"key":"973_CR21","unstructured":"(No date) Chapter 34 data structures and algorithms for nearest neighbor search ... Available at: http:\/\/algorithmics.lsi.upc.edu\/docs\/practicas\/p311-yianilos.pdf (Accessed: 29 October 2023)."},{"issue":"2","key":"973_CR22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1145\/253262.253345","volume":"26","author":"T Bozkaya","year":"1997","unstructured":"Bozkaya T, Ozsoyoglu M. Distance-based indexing for high-dimensional metric spaces. Sigmod Record. 1997;26(2):357\u201368. https:\/\/doi.org\/10.1145\/253262.253345.","journal-title":"Sigmod Record"},{"key":"973_CR23","unstructured":"Weber R, Schek H, Blott S. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the 24rd International Conference on Very Large Data Bases (VLDB \u201898). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1998; 194\u2013205."},{"key":"973_CR24","doi-asserted-by":"publisher","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U. When is \u201cNearest Neighbor\u201d meaningful? In Lecture Notes in Computer Science 1999. pp. 217\u2013235. https:\/\/doi.org\/10.1007\/3-540-49257-7_15.","DOI":"10.1007\/3-540-49257-7_15"},{"key":"973_CR25","doi-asserted-by":"publisher","unstructured":"Kouiroukidis N, Evangelidis G. The Effects of Dimensionality Curse in High Dimensional kNN Search. 15th Panhellenic Conference on Informatics, Kastoria, Greece, 2011. https:\/\/doi.org\/10.1109\/pci.2011.45.","DOI":"10.1109\/pci.2011.45"},{"key":"973_CR26","doi-asserted-by":"publisher","unstructured":"Cui B, Ooi BC, Su J, Tan K. Contorting high dimensional data for efficient main memory KNN processing. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201803). 2003. https:\/\/doi.org\/10.1145\/872757.872815.","DOI":"10.1145\/872757.872815"},{"key":"973_CR27","doi-asserted-by":"publisher","unstructured":"Garcia V, Debreuve \u00c9, Nielsen F, Barlaud M. K-nearest neighbor search: Fast GPU-based implementations and application to high-dimensional feature matching. 2010 IEEE International Conference on Image Processing, Hong Kong, China, 2010. https:\/\/doi.org\/10.1109\/icip.2010.5654017","DOI":"10.1109\/icip.2010.5654017"},{"issue":"1","key":"973_CR28","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10707-009-0076-5","volume":"14","author":"Y Chen","year":"2009","unstructured":"Chen Y, Zhang R, Huang Y, Xiong H. High-dimensional kNN joins with incremental updates. GeoInformatica. 2009;14(1):55\u201382. https:\/\/doi.org\/10.1007\/s10707-009-0076-5.","journal-title":"GeoInformatica"},{"key":"973_CR29","doi-asserted-by":"publisher","unstructured":"Garcia V, Debreuve \u00c9, Barlaud M. Fast k nearest neighbor search using GPU. 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, Anchorage, AK, USA, 2008. https:\/\/doi.org\/10.1109\/cvprw.2008.4563100","DOI":"10.1109\/cvprw.2008.4563100"},{"issue":"1\u20133","key":"973_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0169-7439(87)80084-9","volume":"2","author":"S Wold","year":"1987","unstructured":"Wold S, Esbensen KH, Geladi P. Principal component analysis. Chemom Intell Lab Syst. 1987;2(1\u20133):37\u201352. https:\/\/doi.org\/10.1016\/0169-7439(87)80084-9.","journal-title":"Chemom Intell Lab Syst"},{"key":"973_CR31","unstructured":"Chakrabarti K, Mehrotra S. Local dimensionality reduction: a new approach to indexing high dimensional spaces. In Proceedings of the 26th International Conference on Very Large Data Bases (VLDB \u201800). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 89\u2013100. 2000. https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/02\/ldr.pdf."},{"issue":"4","key":"973_CR32","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/wics.101","volume":"2","author":"H Abdi","year":"2010","unstructured":"Abdi H, Williams LJ. Principal component analysis. WIREs Comput Stat. 2010;2(4):433\u201359. https:\/\/doi.org\/10.1002\/wics.101.","journal-title":"WIREs Comput Stat"},{"key":"973_CR33","doi-asserted-by":"publisher","unstructured":"Vidal R, Ma Y, Sastry SS. Principal component analysis. In Interdisciplinary applied mathematics. 2016. pp. 25\u201362. https:\/\/doi.org\/10.1007\/978-0-387-87811-9_2.","DOI":"10.1007\/978-0-387-87811-9_2"},{"key":"973_CR34","doi-asserted-by":"publisher","unstructured":"Yang C, Yu X, Yang L. Continuous KNN join processing for real-time recommendation. 2014 IEEE International Conference on Data Mining, Shenzhen, China, 2014. https:\/\/doi.org\/10.1109\/icdm.2014.20","DOI":"10.1109\/icdm.2014.20"},{"key":"973_CR35","doi-asserted-by":"publisher","unstructured":"Kibriya AM, Frank E. An empirical comparison of exact nearest neighbour algorithms. In Lecture Notes in Computer Science. 2007. pp. 140\u2013151. https:\/\/doi.org\/10.1007\/978-3-540-74976-9_16.","DOI":"10.1007\/978-3-540-74976-9_16"},{"key":"973_CR36","unstructured":"Bhatia N. Survey of nearest neighbor techniques. 2010. arXiv.org. https:\/\/arxiv.org\/abs\/1007.0085."},{"issue":"25","key":"973_CR37","doi-asserted-by":"publisher","first-page":"39","DOI":"10.5120\/16754-7073","volume":"95","author":"M RezaAbbasifard","year":"2014","unstructured":"RezaAbbasifard M, Ghahremani B, Naderi H. A survey on nearest neighbor search methods. Int J Comput Appl. 2014;95(25):39\u201352. https:\/\/doi.org\/10.5120\/16754-7073.","journal-title":"Int J Comput Appl"},{"key":"973_CR38","unstructured":"Liu T, Moore AW, Yang K, Gray AG. An investigation of practical approximate nearest neighbor algorithms. Neural Inf Proc Syst. 2004; 17: 825\u2013832. http:\/\/papers.nips.cc\/paper\/2666-an-investigation-of-practical-approximate-nearest-neighbor-algorithms.pdf."},{"issue":"8","key":"973_CR39","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/tkde.2019.2909204","volume":"32","author":"W Li","year":"2020","unstructured":"Li W, Zhang Y, Sun Y, Wang W, Li M, Zhang W, Lin X. Approximate nearest neighbor search on high dimensional data\u2014experiments, analyses, and improvement. IEEE Trans Knowl Data Eng. 2020;32(8):1475\u201388. https:\/\/doi.org\/10.1109\/tkde.2019.2909204.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"973_CR40","doi-asserted-by":"publisher","unstructured":"Song G, Rochas J, Huet F, Magoul\u00e8s F. Solutions for processing K Nearest neighbor joins for massive data on MapReduce. 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, Turku, Finland, 2015. https:\/\/doi.org\/10.1109\/pdp.2015.79","DOI":"10.1109\/pdp.2015.79"},{"issue":"9","key":"973_CR41","doi-asserted-by":"publisher","first-page":"2376","DOI":"10.1109\/tkde.2016.2562627","volume":"28","author":"G Song","year":"2016","unstructured":"Song G, Rochas J, Beze LE, Huet F, Magoul\u00e8s F. K Nearest neighbour joins for big data on MapReduce: a theoretical and experimental analysis. IEEE Trans Knowl Data Eng. 2016;28(9):2376\u201392. https:\/\/doi.org\/10.1109\/tkde.2016.2562627.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"973_CR42","unstructured":"Chen Y, Ooi BC, Tan K, Jagadish HV. Indexing the Distance: An Efficient Method to KNN Processing. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB \u201801). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 421\u2013430. 2001. https:\/\/www.vldb.org\/conf\/2001\/P421.pdf."},{"issue":"2","key":"973_CR43","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish HV, Ooi BC, Tan K, Chen Y, Zhang R. IDistance. ACM Trans Database Syst. 2005;30(2):364\u201397. https:\/\/doi.org\/10.1145\/1071610.1071612.","journal-title":"ACM Trans Database Syst"},{"key":"973_CR44","unstructured":"Hu J, Cui B, Shen HT. Diagonal Ordering: a new approach to high-dimensional KNN processing. In Proceedings of the 15th Australasian Database Conference\u2014Volume 27 (ADC \u201804). Australian Computer Society, Inc., AUS, 2004. 39\u201347. https:\/\/crpit.com\/confpapers\/CRPITV27Hu.pdf."},{"issue":"10","key":"973_CR45","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/j.1477-8696.1990.tb05558.x","volume":"45","author":"IT Olliffe","year":"1990","unstructured":"Olliffe IT. Principal component analysis: a beginner\u2019s guide\u2014I. Introduction and application. Weather. 1990;45(10):375\u201382. https:\/\/doi.org\/10.1002\/j.1477-8696.1990.tb05558.x.","journal-title":"Weather"},{"key":"973_CR46","unstructured":"Berchtold S. The X-Tree\u202f: an index structure for High-Dimensional data. 2001. https:\/\/www.semanticscholar.org\/paper\/The-X-tree-%3A-An-Index-Structure-for-Data-Berchtold-Keim\/774db16a3f25a73ceda9e6ab4d5a8b8f3c40605d."},{"issue":"6","key":"973_CR47","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.is.2005.01.001","volume":"31","author":"H Ferhatosmano\u011flu","year":"2006","unstructured":"Ferhatosmano\u011flu H, Tuncel E, Agrawal D, Abbadi AE. High dimensional nearest neighbor searching. Inf Syst. 2006;31(6):512\u201340. https:\/\/doi.org\/10.1016\/j.is.2005.01.001.","journal-title":"Inf Syst"},{"key":"973_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105088","volume":"189","author":"Y Pan","year":"2020","unstructured":"Pan Y, Pan Z, Wang Y, Wang W. A new fast search algorithm for exact k-nearest neighbors based on optimal triangle-inequality-based check strategy. Knowl-Based Syst. 2020;189: 105088. https:\/\/doi.org\/10.1016\/j.knosys.2019.105088.","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"973_CR49","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/TKDE.2015.2460735","volume":"28","author":"AM Almalawi","year":"2016","unstructured":"Almalawi AM, Fahad A, Tari Z, Cheema MA, Khalil I. k NNVWC: an efficient k -nearest neighbors approach based on various-widths clustering. IEEE Trans Knowl Data Eng. 2016;28(1):68\u201381. https:\/\/doi.org\/10.1109\/TKDE.2015.2460735.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"973_CR50","doi-asserted-by":"publisher","unstructured":"Cayton L. Fast nearest neighbor retrieval for bregman divergences. In Proceedings of the 25th International Conference on Machine Learning (ICML \u201808). Association for Computing Machinery, New York, NY, USA. 2008. https:\/\/doi.org\/10.1145\/1390156.1390171.","DOI":"10.1145\/1390156.1390171"},{"issue":"1","key":"973_CR51","doi-asserted-by":"publisher","first-page":"13","DOI":"10.14778\/1687627.1687630","volume":"2","author":"Z Zhang","year":"2009","unstructured":"Zhang Z, Ooi BC, Parthasarathy S, Tung AKH. Similarity search on Bregman divergence. Proc VLDB Endowment. 2009;2(1):13\u201324. https:\/\/doi.org\/10.14778\/1687627.1687630.","journal-title":"Proc VLDB Endowment"},{"key":"973_CR52","doi-asserted-by":"publisher","unstructured":"Song Y, Gu Y, Zhang R. BrePartition: Optimized High-Dimensional kNN Search with Bregman Distances. 2020. arXiv (Cornell University). https:\/\/doi.org\/10.48550\/arxiv.2006.00227.","DOI":"10.48550\/arxiv.2006.00227"},{"key":"973_CR53","doi-asserted-by":"publisher","unstructured":"Aghbari ZA, Makinouchi A. Linearization approach for efficient KNN search of High-Dimensional Data. In Lecture Notes in Computer Science. 2004. pp. 229\u2013238. https:\/\/doi.org\/10.1007\/978-3-540-27772-9_24.","DOI":"10.1007\/978-3-540-27772-9_24"},{"issue":"3","key":"973_CR54","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/tkde.2005.46","volume":"17","author":"B Cui","year":"2005","unstructured":"Cui B, Coi BC, Su J, Tan K. Indexing high-dimensional data for efficient in-memory similarity search. IEEE Trans Knowl Data Eng. 2005;17(3):339\u201353. https:\/\/doi.org\/10.1109\/tkde.2005.46.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"973_CR55","doi-asserted-by":"publisher","unstructured":"Hong H, Guo J, Wang B. An improved KNN algorithm based on adaptive cluster distance bounding for high dimensional indexing. 2012 Third Global Congress on Intelligent Systems, Wuhan, China. 2012. https:\/\/doi.org\/10.1109\/gcis.2012.86.","DOI":"10.1109\/gcis.2012.86"},{"key":"973_CR56","doi-asserted-by":"publisher","unstructured":"Schuh MA, Wylie T, Banda JM, Angryk RA. A comprehensive study of iDistance Partitioning Strategies for KNN Queries and High-Dimensional Data Indexing. In Lecture Notes in Computer Science. 2013. pp. 238\u2013252. https:\/\/doi.org\/10.1007\/978-3-642-39467-6_22.","DOI":"10.1007\/978-3-642-39467-6_22"},{"key":"973_CR57","doi-asserted-by":"publisher","unstructured":"Zhang J, Zhou X, Wang W, Shi B, Pei J. Using high dimensional indexes to support relevance feedback based interactive images retrieval. In Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB \u201806). VLDB Endowment, 2006. 1211\u20131214. https:\/\/doi.org\/10.5555\/1182635.1164246.","DOI":"10.5555\/1182635.1164246"},{"key":"973_CR58","doi-asserted-by":"publisher","unstructured":"Shen HT, Ooi BC, Zhou X. Towards effective indexing for very large video sequence database. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201805). Association for Computing Machinery, New York, NY, USA. 2005. https:\/\/doi.org\/10.1145\/1066157.1066240.","DOI":"10.1145\/1066157.1066240"},{"issue":"8","key":"973_CR59","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1109\/tmc.2006.118","volume":"5","author":"S Ilarri","year":"2006","unstructured":"Ilarri S, Mena E, Illarramendi A. Location-dependent queries in mobile contexts: distributed processing using mobile agents. IEEE Trans Mob Comput. 2006;5(8):1029\u201343. https:\/\/doi.org\/10.1109\/tmc.2006.118.","journal-title":"IEEE Trans Mob Comput"},{"key":"973_CR60","unstructured":"Doulkeridis C, Vlachou A, Kotidis Y, Vazirgiannis M. Peer-to-peer similarity search in metric spaces. In Proceedings of the 33rd International Conference on Very Large Data Bases, 2007. 986\u2013997. http:\/\/www.db-net.aueb.gr\/files\/2007VLDB.pdf."},{"key":"973_CR61","doi-asserted-by":"publisher","unstructured":"Qu L, Chen Y, Xiao Y. iDistance Based Interactive Visual Surveillance Retrieval Algorithm. 2008 International Conference on Intelligent Computation Technology and Automation (ICICTA), Changsha, China, 2008. https:\/\/doi.org\/10.1109\/icicta.2008.13.","DOI":"10.1109\/icicta.2008.13"},{"key":"973_CR62","doi-asserted-by":"publisher","unstructured":"Wang J, Lu J, Zheng F, Ge T, Chen C. PL-Tree: an efficient indexing method for high-dimensional data. In Lecture Notes in Computer Science. 2013. pp. 183\u2013200. https:\/\/doi.org\/10.1007\/978-3-642-40235-7_11.","DOI":"10.1007\/978-3-642-40235-7_11"},{"key":"973_CR63","unstructured":"Schuh MA, Wylie T, Angryk RA. Mitigating the Curse of Dimensionality for Exact kNN Retrieval. In the Twenty-Seventh International Flairs Conference. 2014. https:\/\/dblp.uni-trier.de\/db\/conf\/flairs\/flairs2014.html#SchuhWA14."},{"key":"973_CR64","doi-asserted-by":"publisher","unstructured":"Schuh MA, Wylie T, Angryk RA. Improving the Performance of High-Dimensional kNN Retrieval through Localized Dataspace Segmentation and Hybrid Indexing. In Lecture Notes in Computer Science. 2013. pp. 344\u2013357. https:\/\/doi.org\/10.1007\/978-3-642-40683-6_26.","DOI":"10.1007\/978-3-642-40683-6_26"},{"key":"973_CR65","unstructured":"Wylie T, Schuh MA, Sheppard JW, Angryk RA. Cluster Analysis for Optimal Indexing. In FLAIRS Conference. 2013. https:\/\/academic.timwylie.com\/files\/Wylie_2013_FLAIRS.pdf."},{"key":"973_CR66","doi-asserted-by":"publisher","unstructured":"Tang B, Yiu ML, Hua KA. Exploit every bit: Effective caching for high-dimensional nearest neighbor search (extended abstract). 2017 IEEE 33rd International Conference on Data Engineering (ICDE), San Diego, CA, USA. 2017. https:\/\/doi.org\/10.1109\/icde.2017.29.","DOI":"10.1109\/icde.2017.29"},{"key":"973_CR67","unstructured":"Shang X, Zhu Z, Leimkuhler B, Storkey A. Neural Information Processing Systems (NIPS). Learning to Prune in Metric and Non-Metric Spaces. NIPS: Neural Information Processing Systems. 2015. https:\/\/www.research.ed.ac.uk\/portal\/en\/publications\/covariancecontrolled-adaptive-langevin-thermostat-for-largescale-bayesian-sampling(765825cc-13d9-40d1-8a9e-e696a60e9e36).html."},{"key":"973_CR68","unstructured":"Weber R, Blott SM. An Approximation-Based Data Structure for Similarity Search. ResearchGate. 1998. https:\/\/www.researchgate.net\/publication\/2577157_An_Approximation-Based_Data_Structure_for_Similarity_Search."},{"issue":"1","key":"973_CR69","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/tit.1967.1053964","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover TM, Hart PD. Nearest neighbor pattern classification. IEEE Trans Inf Theory. 1967;13(1):21\u20137. https:\/\/doi.org\/10.1109\/tit.1967.1053964.","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"973_CR70","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/tsmc.1978.4309958","volume":"8","author":"TL Bailey","year":"1978","unstructured":"Bailey TL, Jain A. A note on Distance-Weighted K-Nearest Neighbor rules. IEEE Trans Syst Man Cybern. 1978;8(4):311\u20133. https:\/\/doi.org\/10.1109\/tsmc.1978.4309958.","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"4","key":"973_CR71","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/tit.1979.1056066","volume":"25","author":"KC Gowda","year":"1979","unstructured":"Gowda KC, Krishna G. The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.). IEEE Trans Inf Theory. 1979;25(4):488\u201390. https:\/\/doi.org\/10.1109\/tit.1979.1056066.","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"973_CR72","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/tit.1972.1054809","volume":"18","author":"GW Gates","year":"1972","unstructured":"Gates GW. The reduced nearest neighbor rule (Corresp.). IEEE Trans Inf Theory. 1972;18(3):431\u20133. https:\/\/doi.org\/10.1109\/tit.1972.1054809.","journal-title":"IEEE Trans Inf Theory"},{"key":"973_CR73","unstructured":"Viadinugroho RAA. Imbalanced Classification in Python: SMOTE-ENN Method. Medium. 2022. https:\/\/towardsdatascience.com\/imbalanced-classification-in-python-smote-enn-method-db5db06b8d50."},{"issue":"6","key":"973_CR74","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/tit.1975.1055464","volume":"21","author":"GL Ritter","year":"1975","unstructured":"Ritter GL, Woodruff HB, Lowry SR, Isenhour TL. An algorithm for a selective nearest neighbor decision rule (Corresp.). IEEE Trans Inf Theory. 1975;21(6):665\u20139. https:\/\/doi.org\/10.1109\/tit.1975.1055464.","journal-title":"IEEE Trans Inf Theory"},{"key":"973_CR75","doi-asserted-by":"publisher","unstructured":"Kolahdouzan MR, Shahabi C. Voronoi-Based K Nearest neighbor search for spatial network databases. In Elsevier eBooks. 2004. pp. 840\u2013851. https:\/\/doi.org\/10.1016\/b978-012088469-8.50074-7.","DOI":"10.1016\/b978-012088469-8.50074-7"},{"key":"973_CR76","doi-asserted-by":"publisher","unstructured":"Guo G, Wang H, Bell DA, Bi Y, Greer K. KNN model-based approach in classification. In Lecture Notes in Computer Science. 2003. pp. 986\u2013996. https:\/\/doi.org\/10.1007\/978-3-540-39964-3_62.","DOI":"10.1007\/978-3-540-39964-3_62"},{"key":"973_CR77","unstructured":"Chiang T, Lo H, Lin S. A ranking-based KNN approach for Multi-Label classification. J Mach Learn Res. 2012; 81\u201396. http:\/\/proceedings.mlr.press\/v25\/chiang12\/chiang12.pdf."},{"key":"973_CR78","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.4.3.230-237","author":"Z Yong","year":"2009","unstructured":"Yong Z, Li Y, Xia S. An improved KNN text classification algorithm based on clustering. J Comput. 2009. https:\/\/doi.org\/10.4304\/jcp.4.3.230-237.","journal-title":"J Comput"},{"issue":"11","key":"973_CR79","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1109\/34.888719","volume":"22","author":"S Li","year":"2000","unstructured":"Li S, Chan KL, Wang C. Performance evaluation of the nearest feature line method in image classification and retrieval. IEEE Trans Pattern Anal Mach Intell. 2000;22(11):1335\u20139. https:\/\/doi.org\/10.1109\/34.888719.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"973_CR80","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1016\/j.patcog.2003.11.004","volume":"37","author":"W Zheng","year":"2004","unstructured":"Zheng W, Zhao L, Zou C. Locally nearest neighbor classifiers for pattern classification. Pattern Recogn. 2004;37(6):1307\u20139. https:\/\/doi.org\/10.1016\/j.patcog.2003.11.004.","journal-title":"Pattern Recogn"},{"key":"973_CR81","unstructured":"Kuang Q, Zhao L. A practical GPU based kNN algorithm. International Symposium on Computer Science and Computational Technology (ISCSCT). 2009."},{"key":"973_CR82","doi-asserted-by":"publisher","unstructured":"Batcher KE. Sorting networks and their applications. In Proceedings of the April 30--May 2, 1968, Spring Joint Computer Conference (AFIPS \u201868 (Spring)). 1968. https:\/\/doi.org\/10.1145\/1468075.1468121.","DOI":"10.1145\/1468075.1468121"},{"key":"973_CR83","doi-asserted-by":"publisher","unstructured":"Sismanis N, Pitsianis N, Sun X. Parallel search of k-nearest neighbors with synchronous operations. 2012 IEEE Conference on High Performance Extreme Computing, Waltham, MA, USA, 2012. https:\/\/doi.org\/10.1109\/hpec.2012.6408667.","DOI":"10.1109\/hpec.2012.6408667"},{"key":"973_CR84","doi-asserted-by":"publisher","unstructured":"Liu B, Lee W, Lee DL. Supporting Complex Multi-Dimensional Queries in P2P Systems. 25th IEEE International Conference on Distributed Computing Systems (ICDCS\u201905), Columbus, OH, USA, 2005. https:\/\/doi.org\/10.1109\/icdcs.2005.75.","DOI":"10.1109\/icdcs.2005.75"},{"issue":"3","key":"973_CR85","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s11704-008-0026-7","volume":"2","author":"M Li","year":"2008","unstructured":"Li M, Lee WC, Sivasubramaniam A, Zhao J. Supporting K nearest neighbors query on high-dimensional data in P2P systems. Front Comp Sci. 2008;2(3):234\u201347. https:\/\/doi.org\/10.1007\/s11704-008-0026-7.","journal-title":"Front Comp Sci"},{"key":"973_CR86","doi-asserted-by":"publisher","unstructured":"Jagadish HV, Ooi BC, Vu QH, Zhang R, Zhou A. VBI-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. 22nd International Conference on Data Engineering (ICDE\u201906), Atlanta, GA, USA, 2006. https:\/\/doi.org\/10.1109\/icde.2006.169.","DOI":"10.1109\/icde.2006.169"},{"key":"973_CR87","doi-asserted-by":"publisher","unstructured":"Qiao B, Ding L, Wei Y, Wang X. A KNN Query Processing Algorithm over High-Dimensional Data Objects in P2P Systems. In Advances in intelligent and soft computing. 2012. pp. 133\u2013139. https:\/\/doi.org\/10.1007\/978-3-642-28314-7_19.","DOI":"10.1007\/978-3-642-28314-7_19"},{"issue":"3","key":"973_CR88","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1007\/s11227-011-0672-7","volume":"64","author":"L Jian","year":"2011","unstructured":"Jian L, Wang C, Liu Y, Liang S, Yi W, Shi Y. Parallel data mining techniques on Graphics Processing Unit with Compute Unified Device Architecture (CUDA). J Supercomput. 2011;64(3):942\u201367. https:\/\/doi.org\/10.1007\/s11227-011-0672-7.","journal-title":"J Supercomput"},{"issue":"5","key":"973_CR89","doi-asserted-by":"publisher","first-page":"S667","DOI":"10.1137\/15m1026377","volume":"38","author":"B Xiao","year":"2016","unstructured":"Xiao B, Biros G. Parallel algorithms for nearest neighbor search problems in high dimensions. SIAM J Sci Comput. 2016;38(5):S667\u201399. https:\/\/doi.org\/10.1137\/15m1026377.","journal-title":"SIAM J Sci Comput"},{"key":"973_CR90","doi-asserted-by":"publisher","unstructured":"Clarke LJ, Glendinning I, Hempel R. The MPI Message Passing Interface Standard. In Birkh\u00e4user Basel eBooks. 1994. pp. 213\u2013218. https:\/\/doi.org\/10.1007\/978-3-0348-8534-8_21.","DOI":"10.1007\/978-3-0348-8534-8_21"},{"issue":"1","key":"973_CR91","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum L, Menon R. OpenMP: an industry standard API for shared-memory programming. IEEE Comput Sci Eng. 1998;5(1):46\u201355. https:\/\/doi.org\/10.1109\/99.660313.","journal-title":"IEEE Comput Sci Eng"},{"key":"973_CR92","doi-asserted-by":"publisher","unstructured":"Muhr D, Affenzeller M. Hybrid (CPU\/GPU) exact nearest neighbors search in High-Dimensional Spaces. In IFIP advances in information and communication technology. 2022. pp. 112\u2013123. https:\/\/doi.org\/10.1007\/978-3-031-08337-2_10.","DOI":"10.1007\/978-3-031-08337-2_10"},{"key":"973_CR93","doi-asserted-by":"publisher","unstructured":"Luebke D, Harris MJ, Govindaraju NK, Lefohn A, Houston MJ, Owens JD, Segal MN, Papakipos M, Buck I. S07---GPGPU. In Proceedings of the 2006 ACM\/IEEE Conference on Supercomputing (SC \u201806). Association for Computing Machinery, New York, NY, USA. 2006. https:\/\/doi.org\/10.1145\/1188455.1188672.","DOI":"10.1145\/1188455.1188672"},{"key":"973_CR94","doi-asserted-by":"publisher","unstructured":"Xia C, Lu H, Ooi B, Hu J. GORDERAn Efficient Method for KNN join processing. In Elsevier eBooks. 2004. pp. 756\u2013767. https:\/\/doi.org\/10.1016\/b978-012088469-8\/50067-x.","DOI":"10.1016\/b978-012088469-8\/50067-x"},{"issue":"4","key":"973_CR95","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.infsof.2006.05.006","volume":"49","author":"Y Chen","year":"2007","unstructured":"Chen Y, Cui B, Wang S, Su J. Efficient index-based KNN join processing for high-dimensional data. Inf Softw Technol. 2007;49(4):332\u201344. https:\/\/doi.org\/10.1016\/j.infsof.2006.05.006.","journal-title":"Inf Softw Technol"},{"key":"973_CR96","unstructured":"Wang J. Efficient K-Nearest Neighbor join algorithms for high dimensional sparse data. 2010. arXiv.org. https:\/\/arxiv.org\/abs\/1011.2807."},{"key":"973_CR97","doi-asserted-by":"publisher","unstructured":"Achlioptas D. Database-friendly random projections. Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. 2001. https:\/\/doi.org\/10.1145\/375551.375608.","DOI":"10.1145\/375551.375608"},{"key":"973_CR98","doi-asserted-by":"publisher","unstructured":"Ukey N, Yang Z, Zhang G, Liu B, Li B, Zhang W. Efficient kNN join over dynamic high-dimensional data. In Lecture Notes in Computer Science. 2022. pp. 63\u201375. https:\/\/doi.org\/10.1007\/978-3-031-15512-3_5.","DOI":"10.1007\/978-3-031-15512-3_5"},{"issue":"1","key":"973_CR99","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"JM Dean","year":"2008","unstructured":"Dean JM, Ghemawat S. MapReduce. Commun ACM. 2008;51(1):107\u201313. https:\/\/doi.org\/10.1145\/1327452.1327492.","journal-title":"Commun ACM"},{"key":"973_CR100","unstructured":"CiteSeerX. (n.d.). CiteSeerX. https:\/\/citeseerx.ist.psu.edu\/doc_view\/pid\/17ac002939f8e950ffb32ec4dc8e86bdd8cb5ff1#citations."},{"issue":"9","key":"973_CR101","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/34.955110","volume":"23","author":"J McNames","year":"2001","unstructured":"McNames J. A fast nearest-neighbor algorithm based on a principal axis search tree. IEEE Trans Pattern Anal Mach Intell. 2001;23(9):964\u201376. https:\/\/doi.org\/10.1109\/34.955110.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"973_CR102","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247602","author":"C Zhang","year":"2012","unstructured":"Zhang C, Li F, Jestes J. Efficient parallel kNN joins for large data in MapReduce. ACM Int Conf Proc Ser. 2012. https:\/\/doi.org\/10.1145\/2247596.2247602.","journal-title":"ACM Int Conf Proc Ser"},{"key":"973_CR103","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.eswa.2016.09.031","volume":"67","author":"Z Pan","year":"2017","unstructured":"Pan Z, Wang Y, Ku W. A new k-harmonic nearest neighbor classifier based on the multi-local means. Expert Syst Appl. 2017;67:115\u201325. https:\/\/doi.org\/10.1016\/j.eswa.2016.09.031.","journal-title":"Expert Syst Appl"},{"key":"973_CR104","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.knosys.2017.01.021","volume":"121","author":"Z Pan","year":"2017","unstructured":"Pan Z, Wang Y, Ku W. A new general nearest neighbor classification based on the mutual neighborhood information. Knowl-Based Syst. 2017;121:142\u201352. https:\/\/doi.org\/10.1016\/j.knosys.2017.01.021.","journal-title":"Knowl-Based Syst"},{"issue":"s1","key":"973_CR105","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1111\/j.1365-2478.2012.01123.x","volume":"61","author":"JJS De Figueiredo","year":"2012","unstructured":"De Figueiredo JJS, Oliveira F, Esmi E, Freitas L, Schleicher J, Novais A, Sussner P, Green S. Automatic detection and imaging of diffraction points using pattern recognition. Geophys Prospect. 2012;61(s1):368\u201379. https:\/\/doi.org\/10.1111\/j.1365-2478.2012.01123.x.","journal-title":"Geophys Prospect"},{"key":"973_CR106","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.neucom.2016.07.005","volume":"214","author":"B Nguyen","year":"2016","unstructured":"Nguyen B, Morell C, De Baets B. Large-scale distance metric learning for k-nearest neighbors regression. Neurocomputing. 2016;214:805\u201314. https:\/\/doi.org\/10.1016\/j.neucom.2016.07.005.","journal-title":"Neurocomputing"},{"key":"973_CR107","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.neucom.2017.04.018","volume":"251","author":"Y Song","year":"2017","unstructured":"Song Y, Liang J, L\u00fc J, Zhao X. An efficient instance selection algorithm for k nearest neighbor regression. Neurocomputing. 2017;251:26\u201334. https:\/\/doi.org\/10.1016\/j.neucom.2017.04.018.","journal-title":"Neurocomputing"},{"key":"973_CR108","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176343886","author":"CJ Stone","year":"1977","unstructured":"Stone CJ. Consistent nonparametric regression. Ann Stat. 1977. https:\/\/doi.org\/10.1214\/aos\/1176343886.","journal-title":"Ann Stat"},{"issue":"2","key":"973_CR109","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/tkde.2006.29","volume":"18","author":"F Angiulli","year":"2006","unstructured":"Angiulli F, Basta S, Pizzuti C. Distance-based detection and prediction of outliers. IEEE Trans Knowl Data Eng. 2006;18(2):145\u201360. https:\/\/doi.org\/10.1109\/tkde.2006.29.","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"973_CR110","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10618-008-0093-2","volume":"16","author":"A Ghoting","year":"2008","unstructured":"Ghoting A, Parthasarathy S, Otey ME. Fast mining of distance-based outliers in high-dimensional datasets. Data Min Knowl Disc. 2008;16(3):349\u201364. https:\/\/doi.org\/10.1007\/s10618-008-0093-2.","journal-title":"Data Min Knowl Disc"},{"key":"973_CR111","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.patrec.2018.06.007","volume":"112","author":"N Jin","year":"2018","unstructured":"Jin N, Chen L, Zhou C, Wen Y. Parameter k search strategy in outlier detection. Pattern Recogn Lett. 2018;112:56\u201362. https:\/\/doi.org\/10.1016\/j.patrec.2018.06.007.","journal-title":"Pattern Recogn Lett"},{"issue":"2","key":"973_CR112","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/335191.335437","volume":"29","author":"S Ramaswamy","year":"2000","unstructured":"Ramaswamy S, Rastogi R, Shim K. Efficient algorithms for mining outliers from large data sets. Sigmod Record. 2000;29(2):427\u201338. https:\/\/doi.org\/10.1145\/335191.335437.","journal-title":"Sigmod Record"},{"issue":"1","key":"973_CR113","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1016\/j.eswa.2011.08.040","volume":"39","author":"S Jiang","year":"2012","unstructured":"Jiang S, Pang G, Wu M, Kuang L. An improved K-nearest-neighbor algorithm for text categorization. Expert Syst Appl. 2012;39(1):1503\u20139. https:\/\/doi.org\/10.1016\/j.eswa.2011.08.040.","journal-title":"Expert Syst Appl"},{"key":"973_CR114","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5120\/ijais2021451913","volume":"12","author":"HG Cavalcante","year":"2021","unstructured":"Cavalcante HG. A question classification in closed domain question-answer systems. Int J Appl Inf Syst (IJAIS). 2021;12:1\u20135. https:\/\/doi.org\/10.5120\/ijais2021451913.","journal-title":"Int J Appl Inf Syst (IJAIS)."},{"issue":"1","key":"973_CR115","doi-asserted-by":"publisher","first-page":"61","DOI":"10.14257\/ijdta.2014.7.1.06","volume":"7","author":"V Bijalwan","year":"2014","unstructured":"Bijalwan V, Kumar V, Kumari P, Pascual J. KNN based machine learning approach for text and document mining. Int J Database Theory Appl. 2014;7(1):61\u201370. https:\/\/doi.org\/10.14257\/ijdta.2014.7.1.06.","journal-title":"Int J Database Theory Appl"},{"issue":"10","key":"973_CR116","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1109\/tcsvt.2017.2710120","volume":"28","author":"J Zhao","year":"2018","unstructured":"Zhao J, Han J, Shao L. Unconstrained face recognition using a Set-to-Set distance measure on deep learned features. IEEE Trans Circuits Syst Video Technol. 2018;28(10):2679\u201389. https:\/\/doi.org\/10.1109\/tcsvt.2017.2710120.","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"issue":"8","key":"973_CR117","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5815\/ijigsp.2014.08.01","volume":"6","author":"A Tofighi","year":"2014","unstructured":"Tofighi A, Khairdoost N, Monadjemi SA, Jamshidi K. A robust face recognition system in image and video. Int J Image Graphics Signal Proc. 2014;6(8):1\u201311. https:\/\/doi.org\/10.5815\/ijigsp.2014.08.01.","journal-title":"Int J Image Graphics Signal Proc"},{"key":"973_CR118","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.inffus.2020.01.011","volume":"59","author":"J Zhang","year":"2020","unstructured":"Zhang J, Yin Z, Chen P, Nichele S. Emotion recognition using multi-modal data and machine learning techniques: a tutorial and review. Inf Fusion. 2020;59:103\u201326. https:\/\/doi.org\/10.1016\/j.inffus.2020.01.011.","journal-title":"Inf Fusion"},{"key":"973_CR119","doi-asserted-by":"publisher","unstructured":"Murugappan M. Human emotion classification using wavelet transform and KNN. 2011 International Conference on Pattern Analysis and Intelligence Robotics, Kuala Lumpur, Malaysia, 2011. https:\/\/doi.org\/10.1109\/icpair.2011.5976886.","DOI":"10.1109\/icpair.2011.5976886"},{"key":"973_CR120","first-page":"21","volume":"1","author":"DS Guru","year":"2010","unstructured":"Guru DS, Sharath YH, Manjunath S. Texture features and KNN in classification of flower images. Int J Comput Appl. 2010;1:21\u20139.","journal-title":"Int J Comput Appl"},{"key":"973_CR121","doi-asserted-by":"publisher","unstructured":"Zawbaa HM, Abbass M, Hazman M, Hassenian AE. Automatic fruit image recognition system based on shape and color features. In Communications in computer and information science. 2014. pp. 278\u2013290. https:\/\/doi.org\/10.1007\/978-3-319-13461-1_27.","DOI":"10.1007\/978-3-319-13461-1_27"},{"key":"973_CR122","doi-asserted-by":"publisher","unstructured":"Zanchettin C, Bezerra BLD, Azevedo WW. A KNN-SVM hybrid model for cursive handwriting recognition. The 2012 International Joint Conference on Neural Networks (IJCNN), Brisbane, QLD, Australia, 2012. 2012. https:\/\/doi.org\/10.1109\/ijcnn.2012.6252719.","DOI":"10.1109\/ijcnn.2012.6252719"},{"key":"973_CR123","unstructured":"Hamid NA, Sjarif NNA. Handwritten recognition using SVM, KNN and neural network. arXiv (Cornell University). 2017. https:\/\/arxiv.org\/pdf\/1702.00723.pdf."},{"key":"973_CR124","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.jocs.2018.06.009","volume":"27","author":"S Akila","year":"2018","unstructured":"Akila S, Reddy US. Cost-sensitive Risk Induced Bayesian Inference Bagging (RIBIB) for credit card fraud detection. J Comput Sci. 2018;27:247\u201354. https:\/\/doi.org\/10.1016\/j.jocs.2018.06.009.","journal-title":"J Comput Sci"},{"key":"973_CR125","first-page":"605","volume":"3","author":"SB Imandoust","year":"2013","unstructured":"Imandoust SB, Bolandraftar M. Application of K-nearest neighbor (KNN) approach for predicting economic events theoretical background. Int J Eng Res Appl. 2013;3:605\u201310.","journal-title":"Int J Eng Res Appl"},{"key":"973_CR126","doi-asserted-by":"publisher","unstructured":"Zheng B, Zheng K, Xiao X, Su H, Yin H, Zhou X, Li G. Keyword-aware continuous kNN query on road networks. 2016 IEEE 32nd International Conference on Data Engineering (ICDE), Helsinki, Finland, 2016. 2016. https:\/\/doi.org\/10.1109\/icde.2016.7498297.","DOI":"10.1109\/icde.2016.7498297"},{"issue":"2","key":"973_CR127","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s40033-021-00290-1","volume":"102","author":"DP Tripathy","year":"2021","unstructured":"Tripathy DP, Parida S, Khandu L. Safety risk assessment and risk prediction in underground coal mines using machine learning techniques. J Inst Eng India Series D. 2021;102(2):495\u2013504. https:\/\/doi.org\/10.1007\/s40033-021-00290-1.","journal-title":"J Inst Eng India Series D"},{"key":"973_CR128","doi-asserted-by":"publisher","unstructured":"Mohsen S, Elkaseer A, Scholz S. Human activity recognition using K-Nearest Neighbor Machine Learning Algorithm. In Smart innovation, systems and technologies. 2021. pp. 304\u2013313. https:\/\/doi.org\/10.1007\/978-981-16-6128-0_29.","DOI":"10.1007\/978-981-16-6128-0_29"},{"key":"973_CR129","doi-asserted-by":"publisher","unstructured":"Selma C, Haouzi HBE, Thomas P, Gaudreault J, Morin M. An iterative closest point method for measuring the level of similarity of 3D log scans in wood industry. In Studies in computational intelligence 2018. pp. 433\u2013444. https:\/\/doi.org\/10.1007\/978-3-319-73751-5_33.","DOI":"10.1007\/978-3-319-73751-5_33"},{"issue":"1","key":"973_CR130","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ifacol.2021.08.045","volume":"54","author":"S Chabanet","year":"2021","unstructured":"Chabanet S, Thomas P, El-Haouzi HB, Morin M, Gaudreault J. A kNN approach based on ICP metrics for 3D scans matching: an application to the sawing process. IFAC-PapersOnLine. 2021;54(1):396\u2013401. https:\/\/doi.org\/10.1016\/j.ifacol.2021.08.045.","journal-title":"IFAC-PapersOnLine"},{"key":"973_CR131","doi-asserted-by":"publisher","unstructured":"Al-Faiz MZ, Ali AA, Miry AH. A K-Nearest Neighbor based algorithm for human arm movements recognition using EMG signals. Al-ma\u01e7alla\u1e97 Al-\u02bbir\u0101qiyya\u1e97 Al-handasa\u1e97 Al-kahrab\u0101\u02bciyya\u1e97 Wa-al-ilikttr\u016bniyya\u1e97. 2010;6(2): 158\u2013166. https:\/\/doi.org\/10.33762\/eeej.2010.54888.","DOI":"10.33762\/eeej.2010.54888"},{"key":"973_CR132","doi-asserted-by":"publisher","unstructured":"Shen B, Zhao Y, Li G, Zheng W, Qin Y, Yuan B, Rao Y. V-Tree: Efficient kNN Search on Moving Objects with Road-Network Constraints. 2017 IEEE 33rd International Conference on Data Engineering (ICDE), San Diego, CA, USA, 2017. 2017. https:\/\/doi.org\/10.1109\/icde.2017.115.","DOI":"10.1109\/icde.2017.115"},{"key":"973_CR133","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105217","volume":"190","author":"L Fiorini","year":"2020","unstructured":"Fiorini L, Mancioppi G, Semeraro F, Fujita H, Cavallo F. Unsupervised emotional state classification through physiological parameters for social robotics applications. Knowl-Based Syst. 2020;190: 105217. https:\/\/doi.org\/10.1016\/j.knosys.2019.105217.","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"973_CR134","doi-asserted-by":"publisher","first-page":"012019","DOI":"10.1088\/1757-899x\/557\/1\/012019","volume":"557","author":"MA Markom","year":"2019","unstructured":"Markom MA, Adom AH, Shukor SAA, Rahim NA, Tan ESMM, Ilias B. Improved KNN scan matching for local map classification in mobile Robot Localisation application. IOP Conf Ser Mater Sci Eng. 2019;557(1):012019. https:\/\/doi.org\/10.1088\/1757-899x\/557\/1\/012019.","journal-title":"IOP Conf Ser Mater Sci Eng"},{"issue":"1","key":"973_CR135","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.rcim.2012.06.002","volume":"29","author":"AM Pinto","year":"2013","unstructured":"Pinto AM, Rocha LF, Moreira AP. Object recognition using laser range finder and machine learning techniques. Robot Comput-Integr Manuf. 2013;29(1):12\u201322. https:\/\/doi.org\/10.1016\/j.rcim.2012.06.002.","journal-title":"Robot Comput-Integr Manuf"},{"issue":"8","key":"973_CR136","doi-asserted-by":"publisher","first-page":"3426","DOI":"10.3390\/app11083426","volume":"11","author":"G Xu","year":"2021","unstructured":"Xu G, Pang Y, Bai Z, Wang Y, L\u00fc Z. A fast point clouds registration algorithm for laser scanners. Appl Sci. 2021;11(8):3426. https:\/\/doi.org\/10.3390\/app11083426.","journal-title":"Appl Sci"},{"key":"973_CR137","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/240217","volume":"2014","author":"W Li","year":"2014","unstructured":"Li W, Yi P, Wu Y, Pan L, Li J. A new intrusion detection system based on KNN classification algorithm in wireless sensor network. J Electric Comput Eng. 2014;2014:1\u20138. https:\/\/doi.org\/10.1155\/2014\/240217.","journal-title":"J Electric Comput Eng"},{"issue":"4","key":"973_CR138","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.3390\/s22041407","volume":"22","author":"G Liu","year":"2022","unstructured":"Liu G, Zhao H, Fan F, Liu G, Xu Q, Nazir S. An enhanced intrusion detection model based on improved KNN in WSNs. Sensors. 2022;22(4):1407. https:\/\/doi.org\/10.3390\/s22041407.","journal-title":"Sensors"},{"issue":"12","key":"973_CR139","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.3390\/s16122069","volume":"16","author":"J Yang","year":"2016","unstructured":"Yang J, Sun Z, Chen Y. Fault detection using the Clustering-KNN rule for gas sensor arrays. Sensors. 2016;16(12):2069. https:\/\/doi.org\/10.3390\/s16122069.","journal-title":"Sensors"},{"key":"973_CR140","doi-asserted-by":"publisher","unstructured":"Zhou C, Tham C. GraphEL: A Graph-Based Ensemble Learning Method for Distributed Diagnostics and Prognostics in the Industrial Internet of Things. 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS), Singapore, 2018. 2018. https:\/\/doi.org\/10.1109\/padsw.2018.8644943.","DOI":"10.1109\/padsw.2018.8644943"},{"issue":"11","key":"973_CR141","doi-asserted-by":"publisher","first-page":"29393","DOI":"10.3390\/s151129393","volume":"15","author":"S Liang","year":"2015","unstructured":"Liang S, Ning Y, Li H, Wang L, Mei Z, Ma Y, Zhao G. Feature selection and predictors of falls with foot force sensors using KNN-based algorithms. Sensors. 2015;15(11):29393\u2013407. https:\/\/doi.org\/10.3390\/s151129393.","journal-title":"Sensors"},{"key":"973_CR142","doi-asserted-by":"publisher","unstructured":"Dziubany M, Machhamer R, Laux H, Schmeink A, Gollmer KU, Burger G, Dartmann G. Machine Learning Based Indoor Localization Using a Representative k-Nearest-Neighbor Classifier on a Low-Cost IoT-Hardware. 2018 26th European Signal Processing Conference (EUSIPCO), Rome, Italy, 2018. 2018. https:\/\/doi.org\/10.23919\/eusipco.2018.8553155.","DOI":"10.23919\/eusipco.2018.8553155"},{"issue":"1","key":"973_CR143","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1177\/0165551521991037","volume":"49","author":"B Parlak","year":"2023","unstructured":"Parlak B, Uysal AK. A novel filter feature selection method for text classification: extensive feature selector. J Inf Sci. 2023;49(1):59\u201378. https:\/\/doi.org\/10.1177\/0165551521991037.","journal-title":"J Inf Sci"},{"issue":"6","key":"973_CR144","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1177\/0165551520930897","volume":"47","author":"B Parlak","year":"2021","unstructured":"Parlak B, Uysal AK. The effects of globalisation techniques on feature selection for text classification. J Inf Sci. 2021;47(6):727\u201339. https:\/\/doi.org\/10.1177\/0165551520930897.","journal-title":"J Inf Sci"},{"issue":"5","key":"973_CR145","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1111\/coin.12599","volume":"39","author":"B Parlak","year":"2023","unstructured":"Parlak B. A novel feature ranking algorithm for text classification: brilliant probabilistic feature selector (BPFS). Comput Intell. 2023;39(5):900\u201326. https:\/\/doi.org\/10.1111\/coin.12599.","journal-title":"Comput Intell"},{"key":"973_CR146","doi-asserted-by":"publisher","first-page":"19235","DOI":"10.1007\/s00521-023-08763-y","volume":"35","author":"B Parlak","year":"2023","unstructured":"Parlak B. Ensemble feature selection for single-label text classification: a comprehensive analytical study. Neural Comput Appl. 2023;35:19235\u201351. https:\/\/doi.org\/10.1007\/s00521-023-08763-y.","journal-title":"Neural Comput Appl"},{"key":"973_CR147","doi-asserted-by":"publisher","unstructured":"Mladenova T, Valova I. Comparative analysis between the traditional K-Nearest Neighbor and Modifications with Weight-Calculation, 2022 International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT), Ankara, Turkey, 2022, pp. 961\u2013965, https:\/\/doi.org\/10.1109\/ISMSIT56059.2022.9932693.","DOI":"10.1109\/ISMSIT56059.2022.9932693"},{"key":"973_CR148","doi-asserted-by":"publisher","unstructured":"Briliani A, Irawan B, Setianingsih C. Hate Speech Detection in Indonesian Language on Instagram Comment Section Using K-Nearest Neighbor Classification Method, 2019 IEEE International Conference on Internet of Things and Intelligence System (IoTaIS), Bali, Indonesia, 2019, pp. 98\u2013104, https:\/\/doi.org\/10.1109\/IoTaIS47347.2019.8980398.","DOI":"10.1109\/IoTaIS47347.2019.8980398"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-024-00973-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-024-00973-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-024-00973-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T08:02:56Z","timestamp":1723363376000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-024-00973-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,11]]},"references-count":148,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["973"],"URL":"https:\/\/doi.org\/10.1186\/s40537-024-00973-y","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,11]]},"assertion":[{"value":"18 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"113"}}