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
Dimensionality-Reduction Algorithms for Progressive Visual Analytics
TL;DR: This thesis presents novel algorithmic solutions that enable integration of non-linear dimensionality-reduction techniques in visual analytics systems and presents several applications that are designed to provide unprecedented analytical capabilities in several domains.
Journal ArticleDOI
Quicker range- and k-NN joins in metric spaces
TL;DR: The Quickjoin algorithm is improved by replacing the low level component that handles small subsets with essentially brute-force nested loop with a more efficient method and showing that, contrary to Quicksort, in Quickjoin unbalanced partitioning can improve the algorithm.
Journal ArticleDOI
ADaM: Augmenting existing approximate fast matching algorithms with efficient and exact range queries
TL;DR: A program, ADaM (A PF D NA M apper) which significantly increases final alignment accuracy by first using an existing program to align "easy" sequences, and then using an algorithm with accuracy guarantees (the APF) to align the remaining sequences.
Journal ArticleDOI
3D Drape Reconstruction and Parameterization Based on Smartphone Video and Elliptical Fourier Analysis
TL;DR: 3D fabric drape was reconstructed by using video recorded from a smartphone to reveal shape parameters and indicated that the new features detected by the method were useful to classify different drapes, which provided a novel idea for 3D drape analysis.
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.