108 search results - page 1 / 22 » Cover Trees for Nearest Neighbor |
ICML
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
ALENEX
2001
13 years 6 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
ICCV
2001
IEEE
14 years 6 months ago
2001
IEEE
CVPR
2000
IEEE
14 years 6 months ago
2000
IEEE
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
IBPRIA
2007
Springer
13 years 11 months ago
2007
Springer
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...