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
Posted Content
A New Burrows Wheeler Transform Markov Distance
TL;DR: In this article, the Burrows Wheeler Markov Distance (BWMD) metric is proposed to solve the problem of variable length DNA sequence clustering, which is more adaptable to other domains.
Proceedings ArticleDOI
Adaptive similarity search in metric trees
TL;DR: The search adapts itself to the query in question, so as to avoid unneeded distance comparisons, and the hierarchical search should terminate when no more search- space pruning can be useful, and search then continues linearly through the un-pruned data space.
High-dimensional indexing methods utilizing clustering and dimensionality reduction
Alexander Thomasian,Lijuan Zhang +1 more
TL;DR: This study deals with the inefficiency of multi-dimensional index structures proposed to improve the efficiency of k-NN query processing, which work well in low-dimensional space but lose their efficiency in high- dimensional space due to the curse of dimensionality.
Book ChapterDOI
Pivot learning for efficient similarity search
TL;DR: This paper proposes a new method for learning a set of pivots from existing data objects, in virtue of iterative numerical nonlinear optimization, that significantly reduced the average number of similarity calculations between a query and each object in a database.
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.