Complexity Analysis for Partitioning Nearest Neighbor Searching Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Clustering and singular value decomposition for approximate indexing in high dimensional spaces
Proceedings of the seventh international conference on Information and knowledge management
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for Image Template and Dictionary Matching
Journal of Mathematical Imaging and Vision
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Search Technique for Pattern Recognition Using Relative Distances
IEEE Transactions on Pattern Analysis and Machine Intelligence
Training Set Expansion in Handwritten Character Recognition
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
PCA-based branch and bound search algorithms for computing K nearest neighbors
Pattern Recognition Letters
IEEE Transactions on Knowledge and Data Engineering
Possibilistic instance-based learning
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Fast k-Nearest Neighbor Classification Using Cluster-Based Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Exact k-NN queries on clustered SVD datasets
Information Processing Letters
Cell algorithms with data inflation for non-parametric classification
Pattern Recognition Letters
Persistent clustered main memory index for accelerating k-NN queries on high dimensional datasets
Proceedings of the 2nd international workshop on Computer vision meets databases
Fast k-nearest-neighbor search based on projection and triangular inequality
Pattern Recognition
Some approaches to improve tree-based nearest neighbour search algorithms
Pattern Recognition
Persistent clustered main memory index for accelerating k-NN queries on high dimensional datasets
Multimedia Tools and Applications
Multimedia Tools and Applications
A novel encoding algorithm for vector quantization using transformed codebook
Pattern Recognition
Exact k-NN queries on clustered SVD datasets
Information Processing Letters
Fast exact k nearest neighbors search using an orthogonal search tree
Pattern Recognition
Fast k-nearest neighbors search using modified principal axis search tree
Digital Signal Processing
An innovative framework for securing unstructured documents
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
A Monte Carlo strategy for data-based mathematical modeling
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.14 |
We propose a fast nearest neighbor finding algorithm, named tentatively an ordered partition, based on the ordered lists of the training samples of each projection axis. The ordered partition contains two properties, one is ordering驴to bound the search region, and the other is partitioning驴to reject the unwanted samples without actual distance computations. It is proved that the proposed algorithm can find k nearest neighbors in a constant expected time. Simulations show that the algorithm is rather distribution free, and only 4.6 distance calculations, on the average, were required to find a nearest neighbor among 10 000 samples drawn from a bivariate normal distribution.