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

Authors:
Jim Z. C. Lai;Yi-Ching Liaw;Julie Liu
Affiliations:
Department of Computer Science, National Taiwan Ocean University, Keelung, Taiwan 202, ROC;Department of Computer Science and Information Engineering, Nanhua University, Chiayi, Taiwan 622, ROC;Department of Accounting Information, Oversea Chinese Institute of Technology, Taichung, Taiwan 407, ROC
Venue:
Pattern Recognition
Year:
2007

Citing 17
Cited 12

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

IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to statistical pattern recognition (2nd ed.)

Introduction to statistical pattern recognition (2nd ed.)
Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Vector quantization and signal compression

Vector quantization and signal compression
A near pattern-matching scheme based upon principal component analysis

Pattern Recognition Letters
Visual learning and recognition of 3-D objects from appearance

International Journal of Computer Vision
A fast branch & bound nearest neighbour classifier in metric spaces

Pattern Recognition Letters
A Simple Algorithm for Nearest Neighbor Search in High Dimensions

IEEE Transactions on Pattern Analysis and Machine Intelligence
Searching in metric spaces

ACM Computing Surveys (CSUR)
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Cluster Preserving Embedding of Nonmetric Proximity Data

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition, Third Edition

Pattern Recognition, Third Edition
Multidimensional Binary Search Trees in Database Applications

IEEE Transactions on Software Engineering
Inverse error-diffusion using classified vector quantization

IEEE Transactions on Image Processing
An efficient encoding algorithm for vector quantization based on subvector technique

IEEE Transactions on Image Processing
Fast-searching algorithm for vector quantization using projection and triangular inequality

IEEE Transactions on Image Processing
Side match and overlap match vector quantizers for images

IEEE Transactions on Image Processing

Mixed feature selection based on granulation and approximation

Knowledge-Based Systems
Faster retrieval with a two-pass dynamic-time-warping lower bound

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

Pattern Recognition
Fast global k-means clustering using cluster membership and inequality

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

Pattern Recognition
A fast construction of the distance graph used for the classification of heterogeneous electron microscopic projections

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
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
An agglomerative clustering algorithm using a dynamic k-nearest-neighbor list

Information Sciences: an International Journal
Classification of time-frequency representations based on two-direction 2DLDA for gear fault diagnosis

Applied Soft Computing
Development of a hashing-based data structure for the fast retrieval of 3D terrestrial laser scanned data

Computers & Geosciences
Fast exact local-mean based classification algorithm using class rejection and initial distance assigning processes

Pattern Recognition Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, a novel algorithm for finding k points that are closest to a query point is presented. Some inequalities are used to delete impossible data points and reduce distance computations. Our algorithm makes use of a data point's feature to reject unlikely candidates for a query point and can eliminate many of the unlikely data points, which cannot be rejected by other available algorithms. Experimental results show that our algorithm is superior to other methods in terms of computing time and the number of distance calculations in most cases and is more remarkable, if a larger data set with higher dimension is used. Compared with available approaches, our method can reduce the computing time and number of distance calculations significantly.