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
Fast Neighborhood Graph Search Using Cartesian Concatenation
TL;DR: In this article, the authors propose a new data structure for approximate nearest neighbor search, which augments the neighborhood graph with a bridge graph, which is connected with a few reference vectors near to it.
Book ChapterDOI
Fast Nearest Neighbor Search in SE(3) for Sampling-Based Motion Planning
Jeffrey Ichnowski,Ron Alterovitz +1 more
TL;DR: A novel method for fast exact nearest neighbor searching in \(SE(3))—the 6 dimensional space that represents rotations and translations in 3 dimensions that is commonly used when planning the motions of rigid body robots is presented.
Proceedings ArticleDOI
Affinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases
TL;DR: The proposed index structure solves the existing problems of introducing high-level image relationships in a retrieval mechanism without going through the pain of translating the content-similarity measurement into feature-level equivalence and yet maintaining an efficient structure to organize the large sets of images.
Proceedings ArticleDOI
On optimizing distance-based similarity search for biological databases
TL;DR: A pivot selection heuristic seeking centers and show it outperforms the most widely used corner seeking heuristic and a data partitioning approach sensitive to the actual data distribution in lieu of median splits are developed.
Journal ArticleDOI
Lempel-Ziv Jaccard Distance, an Effective Alternative to Ssdeep and Sdhash
TL;DR: In this article, the Lempel-Ziv Jaccard Distance (LZJD) is used to measure the similarity between binary byte sequences for malware classification and a high performance Java implementation with the same command-line arguments as sdhash is developed, making it easy to integrate into existing workflows.
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.