A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree

Authors:
James McNames
Affiliations:
Portland State Univ., Portland,OR
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2001

Citing 10
Cited 28

A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition

IEEE Transactions on Pattern Analysis and Machine Intelligence
A near pattern-matching scheme based upon principal component analysis

Pattern Recognition Letters
A fast branch & bound nearest neighbour classifier in metric spaces

Pattern Recognition Letters
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Locally Weighted Learning

Artificial Intelligence Review - Special issue on lazy learning
A Simple Algorithm for Nearest Neighbor Search in High Dimensions

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Evaluation of Fast Algorithms for Finding the Nearest Neighbor

ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97)-Volume 2 - Volume 2
Fast tree-structured nearest neighbor encoding for vector quantization

IEEE Transactions on Image Processing
Diagonal axes method (DAM): a fast search algorithm for vector quantization

IEEE Transactions on Circuits and Systems for Video Technology

Low latency photon mapping using block hashing

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
PCA-based branch and bound search algorithms for computing K nearest neighbors

Pattern Recognition Letters
Fast k-nearest-neighbor search based on projection and triangular inequality

Pattern Recognition
Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

Pattern Recognition
Some approaches to improve tree-based nearest neighbour search algorithms

Pattern Recognition
Prototype selection for dissimilarity-based classifiers

Pattern Recognition
Improvement of the k-means clustering filtering algorithm

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
Improvement of the fast exact pairwise-nearest-neighbor algorithm

Pattern Recognition
A novel encoding algorithm for vector quantization using transformed codebook

Pattern Recognition
Online preprocessing of handwritten Gurmukhi strokes

Machine Graphics & Vision International Journal
Fast k most similar neighbor classifier for mixed data (tree k-MSN)

Pattern Recognition
Probably correct k-nearest neighbor search in high dimensions

Pattern Recognition
Fast exact k nearest neighbors search using an orthogonal search tree

Pattern Recognition
Fast k-nearest neighbor search algorithm based on pyramid structure of wavelet transform and its application to texture classification

Digital Signal Processing
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-nearest neighbors search using modified principal axis search tree

Digital Signal Processing
Fast agglomerative clustering using information of k-nearest neighbors

Pattern Recognition
Improved Spectral Hashing

PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
An incremental updating method for clustering-based high-dimensional data indexing

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
SC-tree: an efficient structure for high-dimensional data indexing

BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Estimating gaze direction from low-resolution faces in video

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Fast exact local-mean based classification algorithm using class rejection and initial distance assigning processes

Pattern Recognition Letters
DIMO: distributed index for matching multimedia objects using MapReduce

Proceedings of the 5th ACM Multimedia Systems Conference
Fuzzy nearest neighbor algorithms: Taxonomy, experimental analysis and prospects

Information Sciences: an International Journal
A computational approach for hypersonic nonequilibrium radiation utilizing space partition algorithm and Gauss quadrature

Journal of Computational Physics

Quantified Score

Hi-index	0.15

Visualization

Abstract

A new fast nearest-neighbor algorithm is described that uses principal component analysis to build an efficient search tree. At each node in the tree, the data set is partitioned along the direction of maximum variance. The search algorithm efficiently uses a depth-first search and a new elimination criterion. The new algorithm was compared to 16 other fast nearest-neighbor algorithms on three types of common benchmark data sets including problems from time series prediction and image vector quantization. This comparative study illustrates the strengths and weaknesses of all of the leading algorithms. The new algorithm performed very well on all of the data sets and was consistently ranked among the top three algorithms.