An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
Recent results on the application of a metric-space search algorithm (AESA) to multispeaker data
Proceedings of the NATO Advanced Study Institute on Recent advances in speech understanding and dialog systems
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Lecture Notes on Bucket Algorithms
Lecture Notes on Bucket Algorithms
Graphs and Hypergraphs
A unified approach to indexing and retrieval of information
SIGDOC '94 Proceedings of the 12th annual international conference on Systems documentation: technical communications at the great divide
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Algorithms for Image Template and Dictionary Matching
Journal of Mathematical Imaging and Vision
ACM Computing Surveys (CSUR)
PCA-based branch and bound search algorithms for computing K nearest neighbors
Pattern Recognition Letters
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pivot selection techniques for proximity searching in metric spaces
Pattern Recognition Letters
Fast k-Nearest Neighbor Classification Using Cluster-Based Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the fundamental limits of topology control
Proceedings of the 2004 joint workshop on Foundations of mobile computing
The VLDB Journal — The International Journal on Very Large Data Bases
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Grassmann discriminant analysis: a unifying view on subspace-based learning
Proceedings of the 25th international conference on Machine learning
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Analyzing Metric Space Indexes: What For?
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Fast k most similar neighbor classifier for mixed data (tree k-MSN)
Pattern Recognition
Graph classification by means of Lipschitz embedding
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Indexability, concentration, and VC theory
Proceedings of the Third International Conference on SImilarity Search and APplications
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Low distortion metric embedding into constant dimension
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Indexability, concentration, and VC theory
Journal of Discrete Algorithms
Improving the speed and stability of the k-nearest neighbors method
Pattern Recognition Letters
Approximate bregman near neighbors in sublinear time: beyond the triangle inequality
Proceedings of the twenty-eighth annual symposium on Computational geometry
| Hi-index | 0.14 |
A fast nearest-neighbor algorithm is presented. It works in general spaces in which the known cell techniques cannot be implemented for various reasons, such as the absence of coordinate structure or high dimensionality. The central idea has already appeared several times in the literature with extensive computer simulation results. An exact probabilistic analysis of this family of algorithms that proves its O(1) asymptotic average complexity measured in the number of dissimilarity calculations is presented.