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
Fast Best-Match Shape Searching in Rotation-Invariant Metric Spaces
TL;DR: The metric properties of the rotation-invariant distance measures are explored and an algorithm for fast similarity search in the shape space is proposed that can be utilized in a number of important data mining tasks such as shape clustering and classification, or for discovering of motifs and discords in large image collections.
Speeding up algorithms of SOM Family for Large and High Dimensional Databases
TL;DR: Spatial Access Methods, like R-Tree and k-d Tree, for indexing data, are used to speed up the training process and performance of data analysis methods which learning algorithms are kind of competitive learning.
Journal ArticleDOI
Generalizing the k-Windows clustering algorithm in metric spaces
TL;DR: This paper presents a generalization of the k-Windows clustering algorithm in metric spaces that considers the definition of a distance function over the dataset.
Posted Content
A Generic Framework for Efficient and Effective Subsequence Retrieval
TL;DR: In this paper, the authors propose a generic index structure for metric spaces named "reference net", which is optimized to work well with the Euclidean distance, DTW, ERP, and Frechet distance for time series.
Dissertation
Index Structures for Similarity Search in Multimedia Databases
Bustos Cárdenas,Benjamin Eugenio +1 more
TL;DR: This thesis begins with a study on how to improve the effectiveness (i.e., the quality of the answer) of a similarity retrieval engine, and proposes several algorithms and index structures to improved the efficiency of similarity queries.
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.