DocumentCode :
997865
Title :
Faster nearest-neighbour calculations
Author :
Batchelor, B.G.
Author_Institution :
University of Southampton, Department of Electronics, Southampton, UK
Volume :
13
Issue :
10
fYear :
1977
Firstpage :
304
Lastpage :
306
Abstract :
A technique is described for reducing the computational effort required in finding the nearest neighbour, to a given vector, from among a large training set of vectors. The method begins by finding the nearest among a small set of stored archetypes and uses these distances to limit and control the region of search among the larger set. This search is conducted in a systematic way, which reduces the calculation even further. A simple example is presented in which the saving in computational work is roughly 75°.
Keywords :
computational complexity; pattern recognition; set theory; computational work; nearest neighbour calculations; pattern recognition; vector;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19770222
Filename :
4249371
Link To Document :
بازگشت