A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition Letters
A fast branch & bound nearest neighbour classifier in metric spaces
Pattern Recognition Letters
The String-to-String Correction Problem
Journal of the ACM (JACM)
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
IEEE Transactions on Pattern Analysis and Machine Intelligence
PCA-based branch and bound search algorithms for computing K nearest neighbors
Pattern Recognition Letters
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
A Data Structure and an Algorithm for the Nearest Point Problem
IEEE Transactions on Software Engineering
An improved branch and bound algorithm for computing k-nearest neighbors
Pattern Recognition Letters
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Pattern Recognition
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
Fast Most Similar Neighbor Classifier for Mixed Data
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree
IbPRIA '09 Proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis
New prune rules for similarity search
ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing
Fast k most similar neighbor classifier for mixed data (tree k-MSN)
Pattern Recognition
InstanceRank: Bringing order to datasets
Pattern Recognition Letters
Fast k most similar neighbor classifier for mixed data based on a tree structure
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
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
Combining elimination rules in tree-based nearest neighbor search algorithms
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Impact of the initialization in tree-based fast similarity search techniques
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
A log square average case algorithm to make insertions in fast similarity search
Pattern Recognition Letters
| Hi-index | 0.01 |
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are interested in algorithms that can be used with any dissimilarity function provided that it fits the mathematical notion of distance. Some of such algorithms organize, in preprocessing time, the data in a tree structure that is traversed in search time to find the nearest neighbour. The speedup is obtained using some pruning rules that avoid the traversal of some parts of the tree. In this work two new decomposition methods to build the tree and three new pruning rules are explored. The behaviour of our proposal is studied through experiments with synthetic and real data.