Data structures and algorithms for nearest neighbor search in general metric spaces
Peter N. Yianilos
- pp 311-321
Reads0
Chats0
TLDR
The up-tree (vantage point tree) is introduced in several forms, together‘ with &&ciated algorithms, as an improved method for these difficult search problems in general metric spaces.Abstract:
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation 1s very high. Also relevant are high-dimensional Euclidian settings in which the distribution of data is in some sense of lower dimension and embedded in the space. The up-tree (vantage point tree) is introduced in several forms, together‘ with &&ciated algorithms, as an improved method for these difficult search nroblems. Tree construcI tion executes in O(nlog(n i ) time, and search is under certain circumstances and in the imit, O(log(n)) expected time. The theoretical basis for this approach is developed and the results of several experiments are reported. In Euclidian cases, kd-tree performance is compared.read more
Citations
More filters
Journal ArticleDOI
Improved search heuristics for the sa-tree
Gísli R. Hjaltason,Hanan Samet +1 more
TL;DR: It is shown how to adapt an incremental nearest neighbor algorithm to the sa-tree, which allows computing nearest neighbor in a progressive manner and does not take the unnecessary steps to ensure that keys of "node" elements are monotonically non-decreasing.
Proceedings ArticleDOI
Locality sensitive hashing based searching scheme for a massive database
TL;DR: A locality sensitive hashing based searching scheme (LSS) to achieve highly efficient information searching in a massive database and yield significant improvements over the efficiency of traditional methods.
Proceedings ArticleDOI
A spatial index structure using dynamic recursive space partitioning
TL;DR: Experimental results showed that, for small query regions, MSI structure outperforms the SBI structure and can quickly access query-relevant objects through their corresponding small index in the MSI and ignore irrelevant ones.
Proceedings ArticleDOI
Fast k-NN search
TL;DR: This work proposes a method where multiple random projection trees are combined by a novel voting scheme to exploit the redundancy in a large number of candidate sets obtained by independently generated random projections in order to reduce the number of expensive exact distance evaluations.
Journal ArticleDOI
Fast ANN for High-Quality Collaborative Filtering
TL;DR: This work proposes a GPU‐friendly approximated‐nearest‐neighbour(ANN) algorithm that produces high‐quality results for any type of collaborative filter, and evaluates its ANN search against state‐of‐the‐art ANN algorithms in several application domains.
References
More filters
Book
Introduction to Statistical Pattern Recognition
TL;DR: This completely revised second edition presents an introduction to statistical pattern recognition, which is appropriate as a text for introductory courses in pattern recognition and as a reference book for workers in the field.
Journal ArticleDOI
Voronoi diagrams—a survey of a fundamental geometric data structure
TL;DR: The Voronoi diagram as discussed by the authors divides the plane according to the nearest-neighbor points in the plane, and then divides the vertices of the plane into vertices, where vertices correspond to vertices in a plane.
Journal ArticleDOI
An Algorithm for Finding Best Matches in Logarithmic Expected Time
TL;DR: An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.
Journal ArticleDOI
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
TL;DR: The method of branch and bound is implemented in the present algorithm to facilitate rapid calculation of the k-nearest neighbors, by eliminating the necesssity of calculating many distances.