By Topic

A Technique to Identify Nearest Neighbors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A nonarithmetic procedure is described for discovering among a set of points in a d-dimensional space, the k neighbors nearest a given point, according to the Minkowski "max metric." It is shown that this procedure may be used to eliminate distance calculations when finding nearest neighbors according to any Minkowski p-metric. When used with a set of uniformly distributed sample points, the expected number of distance calculations n required by this technique is given by E[n] ¿ kCp,d where Cp,d is a constant determined by p and d. In the case of the Euclidean metric used in two dimensions with 1000 uniformly distributed sample points, the effective number of distance calculations required to find the nearest neighbor is approximately five.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-6 ,  Issue: 10 )