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 Article
A hierarchical bitmap indexing method for content based multimedia retrieval
Joohyoun Park,Jongho Nang +1 more
TL;DR: This paper proposes an efficient indexing mechanism for NN search to speed-up this filtering process using a novel indexing structure, called hierarchical bitmap, in which each object is represented as a bitmap of size 2ċd where d is the dimension of object's feature vector.
Journal ArticleDOI
On the Application of Convex Transforms to Metric Search
TL;DR: This work studies the underlying properties of convex transforms and their effect on metric indexing mechanisms, and shows there are some spaces where certain transforms may be applied without loss of accuracy, and further spaces where the engineering tradeoffs between accuracy and efficiency can be understood.
Book ChapterDOI
A New Approach for Optimization of Dynamic Metric Access Methods Using an Algorithm of Effective Deletion
TL;DR: An algorithm that effectively removes any element from a metric tree while maintaining the height-balancing of the structure is described, and the proposed deletion algorithm uses mechanisms to enforce a reduced number of pages in the tree, improving the query performance.
Journal ArticleDOI
Persistent Semi-Dynamic Ordered Partition Index
Alexander Thomasian,Lijuan Zhang +1 more
TL;DR: This work proposes an alternative solution to indexing high-dimensional data, which takes advantage of increasing main memory sizes and the 40% annual improvement in disk transfer rates, and makes the Ordered-Partition---OP-tree, which is a main memory resident index, persistent by writing it onto disk.
Journal ArticleDOI
Fast anytime retrieval with confidence in large-scale temporal case bases
TL;DR: This work describes the algorithm and methodology to construct a probabilistic model that is used both to estimate confidence upon interruption and to automatize the interruption at desired confidence thresholds and shows superior gains compared to brute-force search.
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.