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
Curse of Dimensionality in the Application of Pivot-based Indexes to the Similarity Search Problem
TL;DR: The curse of dimensionality for indexing of databases for similarity search is confirmed if the spaces $\Omega_d$ exhibit the (fairly common) concentration of measure phenomenon the performance of similarity search using such indexes is asymptotically linear in $n$.
Book ChapterDOI
High-Dimensional Modeling for Cytometry: Building Rock Solid Models Using GemStone™ and Verity Cen-se’™ High-Definition t-SNE Mapping
TL;DR: This chapter outlines how to approach the complex tasks associated with designing models for high-dimensional cytometry data, which lends itself to automation and accounts for measurement overlap among cellular populations.
Book ChapterDOI
Efficiency and Scalability Issues in Metric Access Methods
TL;DR: This chapter explains and proves by experiments that similarity searching is typically an expensive process which does not easily scale to very large volumes of data, thus distributed architectures able to exploit parallelism must be employed.
Proceedings ArticleDOI
DBM*-Tree: an efficient metric access method
TL;DR: A new dynamic Metric Access Method called DBM*-Tree, which uses precomputed distances to reduce the construction cost avoiding repeated calculus of distance and a new algorithm to select the suitable subtree in the insertion operation, which is an evolution of the previous methods.
Dissertation
De l'appariement a l'indexation des images
TL;DR: Dans un premier temps, nous presentons diverses methodes d'appariement d'images adaptees specifiquement aux images structurees, texturees en niveaux de gris ou en couleur.
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.