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
Classification with nonmetric distances: image retrieval and class representation
TL;DR: It is shown that in nonmetric spaces, boundary points are less significant for capturing the structure of a class than in Euclidean spaces, and it is suggested that atypical points may be more important in describing classes.
Patent
Method and apparatus for predicting object properties and events using similarity-based information retrieval and modeling
TL;DR: In this paper, the authors proposed a method for predicting properties of a target object by combining multivariate statistical analysis and principal component analysis in combination with content-based image retrieval for providing two-dimensional attributes of three dimensional objects, for example, via preferential image segmentation using a tree of shapes.
Journal ArticleDOI
Searching in metric spaces by spatial approximation
TL;DR: In this article, the authors propose a data structure called sa-tree (SPatial approximation tree), which is based on approaching the searched objects spatially, that is, getting closer and closer to them.
Proceedings ArticleDOI
Fast, scalable detection of "Piggybacked" mobile applications
TL;DR: This paper proposes a module decoupling technique to partition an app's code into primary and non-primary modules, and develops a feature fingerprint technique to extract various semantic features from primary modules and convert them into feature vectors.
Journal ArticleDOI
A sparse embedding and least variance encoding approach to hashing
Xiaofeng Zhu,Lei Zhang,Zi Huang +2 more
TL;DR: This paper partitions the sample space into clusters via a linear spectral clustering method, and represents each sample as a sparse vector of normalized probabilities that it falls into its several closest clusters and proposes a least variance encoding model, which learns a dictionary to encode the sparse embedding feature, and consequently binarize the coding coefficients as the hash codes.
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.