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
DissertationDOI
Explicitly Correlating Agent’s Daily Plans in a Multiagent Transport Simulation: Towards the Consideration of Social Relationships
TL;DR: In this paper, Zusammenfassung et al. presented a method to solve the problem of homonymity in ZusammmenfASSung, which is
Journal ArticleDOI
The NOBH-tree
TL;DR: This paper proposes a new family of metric access methods, called NOBH-trees that allow a non-overlapping division of the data space, combining Voronoi-shaped with ball-shaped regions to partition the metric space and shows how to query the subspaces divided by the hyperplanes.
Proceedings ArticleDOI
Range queries in natural language dictionaries with recursive lists of clusters
TL;DR: RLC is the only data structure that always keeps its good performance, whether the space dimension is lower or higher, and whether the query radius is smaller or larger.
Proceedings ArticleDOI
Towards indexing functions: answering scalar product queries
TL;DR: This work presents a lightweight, yet scalable, dynamic, and generalized indexing scheme, called the planar index, for answering scalar product queries in an accurate manner, based on the idea of indexing function f(x) for each data point x using multiple sets of parallel hyperplanes.
Journal ArticleDOI
Detecting phase transitions in collective behavior using manifold's curvature
Kelum Gajamannage,Erik M. Bollt +1 more
TL;DR: In this article, the authors propose a method of detecting phase transition and splitting the manifold into phase transition free sub-manifolds, based on the relationship between curvature and singular value ratio of points sampled in a curve.
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.