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
Novel correspondence-based approach for consistent human skeleton extraction
TL;DR: The skeleton extraction based on BSC approach is more accurate than the traditional direct skeleton extraction methods and can be applied to various applications such as skeleton-driven animation, shape segmentation and human motion analysis.
Proceedings ArticleDOI
A new classification rule based on nearest neighbour search
TL;DR: This work introduces a new classification rule applicable to many of the fast nearest neighbour search algorithms in order to obtain classification rates better than those of the nearest neighbour (similar toThose of the k-NN rule) without significantly increasing classification time.
Proceedings ArticleDOI
High-Dimensional Similarity Query Processing for Data Science
TL;DR: A comprehensive review of high-dimensional similarity query processing for data science can be found in this article, where the authors introduce solutions from a variety of research communities, including data mining (DM), database (DB), machine learning (ML), computer vision (CV), natural language processing (NLP), and theoretical computer science (TCS).
Journal ArticleDOI
Best-match retrieval for structured images
TL;DR: A triangle inequality property for the tree-distance introduced by Oflazer (1997) is proven and this property is applied to obtain a saturation algorithm of the trie used to store the database of the collection of pictures.
Journal ArticleDOI
Optimal distance bounds for fast search on compressed time-series query logs
TL;DR: This work explicates how to compute the lower and upper distance bounds on the time-series logs when working directly on their compressed form, and derivation of the optimal distance bounds is based on the careful analysis of the problem using optimization principles.
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.