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
A Privacy-Preserving Similarity Search Scheme over Encrypted Word Embeddings
TL;DR: This study proposes a privacy-preserving similar document search system based on Simhash that is open to the latest machine-learning based IR schemes, and performance has been tuned utilizing a VP-tree based index, which is optimized for security.
Improving Point Cloud Quality for Mobile Laser Scanning
TL;DR: New approaches to storing, searching and displaying point cloud data as well as algorithms for calibrating mobile laser scanners and registering laser scans are presented and discussed.
DissertationDOI
A generalized multidimensional index structure for multimedia data to support content-based similarity searches in a collaborative search environment
TL;DR: A generalized multidimensional index structure is proposed which accommodates the atypical multiddimensional representation and the semantic information carried by different multimedia data seamlessly from within one single framework.
Proceedings ArticleDOI
DDS: an efficient dynamic dimension selection algorithm for nearest neighbor search in high dimensions
Chia-Chen Kuo,Ming-Syan Chen +1 more
TL;DR: An efficient dynamic dimension selection algorithm is proposed to improve the performance of the nearest neighbor search especially in high dimensions.
Proceedings ArticleDOI
Projection search for approximate nearest neighbor
Cheng Feng,Bo Yang +1 more
TL;DR: This paper proposes a tree-based approximate nearest neighbor search algorithm that greatly reduce the cost of tree traversal by limiting the search area within the nearby cells where the query lies in, and excluding those far apart.
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.