%0 Journal Article %1 abbasifard2014survey %A Abbasifard, Mohammad Reza %A Ghahremani, Bijan %A Naderi, Hassan %D 2014 %J International Journal of Computer Applications %K distance knn nearest neighbor search similarity survey %N 25 %P 39--52 %T A Survey on Nearest Neighbor Search Methods %U https://www.ijcaonline.org/archives/volume95/number25/16754-7073 %V 95 %X Nowadays, the need to techniques, approaches, and algorithms to search on data is increased due to improvements in computer science and increasing amount of information. This ever increasing information volume has led to time and computation complexity. Recently, different methods to solve such problems are proposed. Among the others, nearest neighbor search is one of the best techniques to this end which is focused by many researchers. Different techniques are used for nearest neighbor search. In addition to put an end to some complexities, variety of these techniques has made them suitable for different applications such as pattern recognition, searching in multimedia data, information retrieval, databases, data mining, and computational geometry to name but a few. In this paper, by opening a new view to this problem, a comprehensive evaluation on structures, techniques and different algorithms in this field is done and a new categorization of techniques in NNS is presented. This categorization is consists of seven groups: Weighted, Reductional, Additive, Reverse, Continuous, Principal Axis and Other techniques which are studied, evaluated and compared in this paper. Complexity of used structures, techniques and their algorithms are discussed, as well.

@article{abbasifard2014survey, abstract = {Nowadays, the need to techniques, approaches, and algorithms to search on data is increased due to improvements in computer science and increasing amount of information. This ever increasing information volume has led to time and computation complexity. Recently, different methods to solve such problems are proposed. Among the others, nearest neighbor search is one of the best techniques to this end which is focused by many researchers. Different techniques are used for nearest neighbor search. In addition to put an end to some complexities, variety of these techniques has made them suitable for different applications such as pattern recognition, searching in multimedia data, information retrieval, databases, data mining, and computational geometry to name but a few. In this paper, by opening a new view to this problem, a comprehensive evaluation on structures, techniques and different algorithms in this field is done and a new categorization of techniques in NNS is presented. This categorization is consists of seven groups: Weighted, Reductional, Additive, Reverse, Continuous, Principal Axis and Other techniques which are studied, evaluated and compared in this paper. Complexity of used structures, techniques and their algorithms are discussed, as well. }, added-at = {2021-06-18T11:24:12.000+0200}, author = {Abbasifard, Mohammad Reza and Ghahremani, Bijan and Naderi, Hassan}, biburl = {https://www.bibsonomy.org/bibtex/23de209123b17b9f23de406d3b09f9f9d/jaeschke}, interhash = {6d464d5034e72c40fa779a0dcfb8a72c}, intrahash = {3de209123b17b9f23de406d3b09f9f9d}, journal = {International Journal of Computer Applications}, keywords = {distance knn nearest neighbor search similarity survey}, month = jun, number = 25, pages = {39--52}, timestamp = {2021-06-18T11:24:27.000+0200}, title = {A Survey on Nearest Neighbor Search Methods}, url = {https://www.ijcaonline.org/archives/volume95/number25/16754-7073}, volume = 95, year = 2014 }