A Survey on Nearest Neighbor Search Methods
TLDR
A comprehensive evaluation on structures, techniques and different algorithms in this field is done and a new categorization of techniques in NNS is presented and variety of these techniques has made them suitable for different applications such as pattern recognition.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.read more
Citations
More filters
Posted ContentDOI
Semantic Models for the First-stage Retrieval: A Comprehensive Review.
TL;DR: The current landscape of semantic retrieval models from three major paradigms, paying special attention to recent neural-based methods, is described in this article, where the authors review the benchmark datasets, optimization methods and evaluation metrics, and summarize the state-of-theart models.
Journal ArticleDOI
A CBR framework with gradient boosting based feature selection for lung cancer subtype classification.
Juan Ramos-González,Daniel López-Sánchez,José A. Castellanos-Garzón,Juan F. De Paz,Juan M. Corchado +4 more
TL;DR: A novel Case Based Reasoning framework with gradient boosting based feature selection is proposed and applied to the task of squamous cell carcinoma and adenocarcinoma discrimination, aiming to provide accurate diagnosis with a reduced set of genes.
Journal ArticleDOI
Computational workload in biometric identification systems: an overview
TL;DR: Taxonomy for conceptual categorisation of methods with the aim of reducing or optimising the computational workload, and thereby speeding-up the identification transactions, in biometric identification systems are presented.
Journal ArticleDOI
Ensemble of Filter-Based Rankers to Guide an Epsilon-Greedy Swarm Optimizer for High-Dimensional Feature Subset Selection
TL;DR: This paper proposes a novel hybrid filter-wrapper algorithm, called Ensemble of Filter-based Rankers to guide an Epsilon-greedy Swarm Optimizer (EFR-ESO), for solving high-dimensional feature subset selection.
Posted Content
Deep Adversarial Network Alignment
TL;DR: This work presents a Deep Adversarial Network Alignment (DANA) framework that first uses deep adversarial learning to discover complex mappings for aligning the embedding distributions of the two networks, and performs an efficient nearest neighbor node alignment.
References
More filters
Journal ArticleDOI
Nearest neighbor pattern classification
Thomas M. Cover,Peter E. Hart +1 more
TL;DR: The nearest neighbor decision rule assigns to an unclassified sample point the classification of the nearest of a set of previously classified points, so it may be said that half the classification information in an infinite sample set is contained in the nearest neighbor.
Proceedings ArticleDOI
R-trees: a dynamic index structure for spatial searching
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
Journal ArticleDOI
Multidimensional binary search trees used for associative searching
TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
Proceedings Article
Similarity Search in High Dimensions via Hashing
TL;DR: Experimental results indicate that the novel scheme for approximate similarity search based on hashing scales well even for a relatively large number of dimensions, and provides experimental evidence that the method gives improvement in running time over other methods for searching in highdimensional spaces based on hierarchical tree decomposition.
Journal ArticleDOI
The Quadtree and Related Hierarchical Data Structures
TL;DR: L'accentuation est mise sur la representation de donnees dans les applications de traitement d'images, d'infographie, les systemes d'informations geographiques and the robotique.
Related Papers (5)
Approximate nearest neighbors: towards removing the curse of dimensionality
Piotr Indyk,Rajeev Motwani +1 more