An Algorithm for Finding Nearest Neighbors

Authors:
J. H. Friedman;F. Baskett;L. J. Shustek
Affiliations:
Stanford Linear Accelerator Center;-;-
Venue:
IEEE Transactions on Computers
Year:
1975

Citing 0
Cited 23

A Symmetric Nearest Neighbor Learning Rule

EWCBR '00 Proceedings of the 5th European Workshop on Advances in Case-Based Reasoning
Commodity Real-time Stereo Vision for Navigation

CRV '04 Proceedings of the 1st Canadian Conference on Computer and Robot Vision
Cell algorithms with data inflation for non-parametric classification

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

Pattern Recognition
Prediction of homo-oligomeric proteins based on nearest neighbour algorithm

Computers in Biology and Medicine
On k-Nearest Neighbor Voronoi Diagrams in the Plane

IEEE Transactions on Computers
Mutual Information Estimation in Higher Dimensions: A Speed-Up of a k-Nearest Neighbor Based Estimator

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
A computer package for modeling and simulating regionalized count variables

Computers & Geosciences
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
Neighborhood graphs for indexing and retrieving multi-dimensional data

Journal of Intelligent Information Systems
Experiments on the preference-based organization interface in recommender systems

ACM Transactions on Computer-Human Interaction (TOCHI)
Paper: Nearest neighbor classification on two types of SIMD machines

Parallel Computing
Reducing the size of traveling salesman problem instances by fixing edges

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Approximate all nearest neighbor search for high dimensional entropy estimation for image registration

Signal Processing
An effective method for locally neighborhood graphs updating

DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Methods of decreasing the number of support vectors via k-mean clustering

ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Survey: Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: A review and state-of-the-art

Computer Science Review
Automated user modeling for personalized digital libraries

International Journal of Information Management: The Journal for Information Professionals
A test for spatial randomness based on k-NN distances

Pattern Recognition Letters
Approximative fast nearest-neighbour recognition

Pattern Recognition Letters
Fast near neighbor search in high-dimensional binary data

ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
A multi-resource load balancing algorithm for cloud cache systems

Proceedings of the 28th Annual ACM Symposium on Applied Computing

Quantified Score

Hi-index	14.98

Visualization

Abstract

An algorithm that finds the k nearest neighbors of a point, from a sample of size N in a d-dimensional space, with an expected number of distance calculations is described, its properties examined, and the validity of the estimate verified with simulated data.