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 ContentDOI
Multi-resolution single-cell state characterization via joint archetypal/network analysis
Shahin Mohammadi,Shahin Mohammadi,Jose Davila-Velderrain,Jose Davila-Velderrain,Manolis Kellis,Manolis Kellis +5 more
TL;DR: ACTIONet is introduced, a comprehensive framework that combines archetypal analysis and network theory to provide a ready-to-use analytical approach for multiresolution single-cell state characterization.
Journal Article
Seamless Integration of Distance Functions and Feature Vectors for Similarity-Queries Processing
TL;DR: This paper extends and improves the original strategy of the existing middleware SIREN into a new, complete similarity-enabled framework called SimbA, which allows a much tighter and flexible handling of new complex data types, FEM, DF and MAM in a seamless abstraction.
Proceedings ArticleDOI
Scalable forest hashing for fast similarity search
Gang Yu,Junsong Yuan +1 more
TL;DR: A novel data-driven hashing method called forest hashing, which utilizes multiple tree structures to perform data hashing by leveraging the index structure of trees, which can significantly improve the hashing efficacy by generating balanced hash buckets.
Journal ArticleDOI
Metrics defined by Bregman divergences: Part 2
TL;DR: A min-max approach to getting a metric from Bregman divergence is provided and it is shown that the "capacity" to the power 1/e is a metric.
Patent
Determining documents that match a query
TL;DR: A computer-implemented method and system for determining documents that are nearest to a query are provided in this paper, which includes constructing a vantage point tree based on a number of document vectors.
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.