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
Proceedings ArticleDOI
A Nearest Neighbor Search Engine Using Distance-Based Hashing
TL;DR: An FPGA-based nearest neighbor search engine for high-dimensional data, in which nearest neighbors search is performed based on distance-based hashing, which finds an exact solution with high probability.
Information theoretic measures of transitions to collective behaviour
TL;DR: In this article, the authors propose an approach of 0.75.1.25 -0.5.0.0 -1.0-0.00-1.
Proceedings Article
VP-tree: Content-Based Image Indexing.
TL;DR: This paper introduces an implementation of a vantage point tree method and the goal is to define dependencies between method's parameters and index efficiency criteria in the context of the content-based image retrieval task.
Proceedings ArticleDOI
Automatic Application Identification from Billions of Files
TL;DR: By combining information gleaned from a large number of endpoints (millions of computers), this system can accomplish large-scale application identification automatically and reliably, and it manages to successfully identify which files belong to which application with very high precision, and adequate recall.
Proceedings ArticleDOI
Distributed indexes design to accelerate similarity based images retrieval in airport video monitoring systems
TL;DR: Experiments on large high-dimensional metric spaces data show that D-MVP indexing model has more significant performance improvement compared with the traditional indexing structure and is highly scalable with the explosive growth of data.
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.