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
Journal ArticleDOI
Trinary-Projection Trees for Approximate Nearest Neighbor Search
TL;DR: This work presents a coordinate-wise enumeration algorithm to find the principal trinary-projection direction and provides an extension using multiple randomized trees for improved performance on large-scale local patch indexing and similar image search.
Journal ArticleDOI
Dynamic spatial approximation trees
TL;DR: Different methods to handle insertions and deletions on the sa--tree at low cost are studied, and the dynamic version significantly improves the search performance of sa--trees in virtually all cases.
Proceedings ArticleDOI
Accelerating Nearest Neighbor Search on Manycore Systems
TL;DR: These algorithms factor into easily parallelizable components, making them simple to deploy and efficient on multicore CPUs and GPUs, and provide substantial speedups on a range of datasets and hardware platforms.
Book
Software Similarity and Classification
Silvio Cesare,Yang Xiang +1 more
TL;DR: Software similarity and classification is an emerging topic with wide applications applicable to the areas of malware detection, software theft detection, plagiarism detection, and software clone detection and demonstrates that considering these applied problems as a similarity and Classification problem enables techniques to be shared between areas.
Proceedings ArticleDOI
Enabling Fast Lazy Learning for Data Streams
TL;DR: This paper proposes a novel Lazy-tree (Ltree for short) indexing structure that dynamically maintains compact high-level summaries of historical stream records that can help achieve great memory consumption reduction and sub-linear time complexity for prediction.
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.