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
Using MoBIoS' scalable genome join to find conserved primer pair candidates between two genomes
Weijia Xu,Willard J. Briggs,Joanna Padolina,Ruth Timme,Wenguo Liu,C. Randal Linder,Daniel P. Miranker +6 more
TL;DR: In this article, a set of paired, conserved DNA oligomers that may be used as primers to amplify orthologous DNA regions using the polymerase chain reaction (PCR) was developed for identifying evolutionary reticulation events in flowering plants.
Journal ArticleDOI
Authenticated Subgraph Similarity Searchin Outsourced Graph Databases
TL;DR: This paper proposes an authentication-friendly metric index called GMTree, and transforms the similarity search into a search in a graph metric space and derive small verification objects (VOs) to-be-transmitted to query clients.
Proceedings Article
Learning to Prune in Metric and Non-Metric Spaces
TL;DR: The VP-tree with a learned pruner is compared against the recently proposed state-of-the-art approaches: the bbtree, the multi-probe locality sensitive hashing (LSH), and permutation methods and, in most cases, was more efficient for the same rank approximation quality.
Journal ArticleDOI
A comparison of pivot selection techniques for permutation-based indexing
TL;DR: Five pivot selection techniques on three permutation-based similarity access methods are compared and a novel technique specifically designed for permutations is proposed, indicating that the pivot selection technique should be considered as an integrating and relevant part of any permutations-based access method.
Journal Article
Center-Based Indexing in Vector and Metric Spaces
TL;DR: The experiments show that the iterative k-means splitting procedure accelerates significantly k-nn searching over the one-step procedure used in other indexing structures such as GNAT, SS-tree and M- tree and that the relevant representation of a tree node is an important issue for the performance of the search process.
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.