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
Proceedings ArticleDOI
Effective Use of Space for Pivot-Based Metric Indexing Structures
TL;DR: A new method is offered that evaluates the effectiveness of pivots in a better fashion by making use of the overall distance distribution, and is able to offer very good space- performance trade-offs compared to AESA and tree-based methods.
Proceedings ArticleDOI
Ranger: a tool for nearest neighbor search in high dimensions
Michael Murphy,Steven Skiena +1 more
TL;DR: Ranger is a tool for visualizing and experimenting with nearest neighbor and orthogonal range queries in highdimensional data sets, using multidimensional search trees.
Journal ArticleDOI
Similarity query processing for high-dimensional data
TL;DR: This tutorial reviews exact and approximate methods such as cover tree, locality sensitive hashing, product quantization, and proximity graphs, and discusses the selectivity estimation problem and shows how researchers are bringing in state-of-the-art ML techniques to address the problem.
Journal ArticleDOI
Vision-based hand pose estimation through similarity search using the earth mover's distance
TL;DR: A two-tier search method is proposed which achieves similar accuracy with a speed increase of two orders of magnitude and is evaluated using real input and the results obtained using the different approaches are compared.
Approximate Nearest Neighbor Search Small World Approach
TL;DR: A novel approach to solving the nearest neighbor search problem by building a non-hierarchical structure with possibility of local minimums which are circumvented by performing a series of searches starting from arbitrary elements of the structure.
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.