Artificial intelligence (3rd ed.)
Artificial intelligence (3rd ed.)
Pattern Recognition Letters
Visual learning and recognition of 3-D objects from appearance
International Journal of Computer Vision
Discriminant Adaptive Nearest Neighbor Classification
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Fast Algorithm for the Nearest-Neighbor Classifier
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast parallel similarity search in multimedia databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Stereo Matching as a Nearest-Neighbor Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Design of Reduced-Complexity Nearest-Neighbor Classifiers Using Triangular Inequality
IEEE Transactions on Pattern Analysis and Machine Intelligence
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Relaxing the Triangle Inequality in Pattern Matching
International Journal of Computer Vision
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Fast texture synthesis using tree-structured vector quantization
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Multidimensional binary search trees used for associative searching
Communications of the ACM
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
IEEE Transactions on Pattern Analysis and Machine Intelligence
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space
IEEE Transactions on Knowledge and Data Engineering
Fast Nearest-Neighbor Search in Dissimilarity Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
An Algorithm for Finding Nearest Neighbors
IEEE Transactions on Computers
IEEE Transactions on Image Processing
Fast block matching algorithm based on the winner-update strategy
IEEE Transactions on Image Processing
Image Fusion Algorithm Using RBF Neural Networks
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
Fast k most similar neighbor classifier for mixed data (tree k-MSN)
Pattern Recognition
A Non-sequential Representation of Sequential Data for Churn Prediction
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Addressing the problems of data-centric physiology-affect relations modeling
Proceedings of the 15th international conference on Intelligent user interfaces
Fast exact k nearest neighbors search using an orthogonal search tree
Pattern Recognition
Fast k most similar neighbor classifier for mixed data based on approximating and eliminating
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Noisy data elimination using mutual k-nearest neighbor for classification mining
Journal of Systems and Software
Parallel k-most similar neighbor classifier for mixed data
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Coarse to fine K nearest neighbor classifier
Pattern Recognition Letters
Hi-index | 0.01 |
In this paper, we present a fast and versatile algorithm which can rapidly perform a variety of nearest neighbor searches. Efficiency improvement is achieved by utilizing the distance lower bound to avoid the calculation of the distance itself if the lower bound is already larger than the global minimum distance. At the preprocessing stage, the proposed algorithm constructs a lower bound tree (LB-tree) by agglomeratively clustering all the sample points to be searched. Given a query point, the lower bound of its distance to each sample point can be calculated by using the internal node of the LB-tree. To reduce the amount of lower bounds actually calculated, the winner-update search strategy is used for traversing the tree. For further efficiency improvement, data transformation can be applied to the sample and the query points. In addition to finding the nearest neighbor, the proposed algorithm can also (i) provide the k-nearest neighbors progressively; (ii) find the nearest neighbors within a specified distance threshold; and (iii) identify neighbors whose distances to the query are sufficiently close to the minimum distance of the nearest neighbor. Our experiments have shown that the proposed algorithm can save substantial computation, particularly when the distance of the query point to its nearest neighbor is relatively small compared with its distance to most other samples (which is the case for many object recognition problems).