Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces

DMCA

Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces (1993)

Cached

Download Links

[www.intermemory.net]
[www-db.deis.unibo.it]

Other Repositories/Bibliography

CiteULike
DBLP

by Peter N. Yianilos

Citations:

358 - 5 self

BibTeX

@INPROCEEDINGS{Yianilos93datastructures,
    author = {Peter N. Yianilos},
    title = {Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces},
    booktitle = {},
    year = {1993},
    pages = {311--321},
    publisher = {}
}

OpenURL

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 is 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 vp-tree (vantage point tree) is introduced in several forms, together with associated algorithms, as an improved method for these difficult search problems. Tree construction executes in O(n log(n)) time, and search is under certain circumstances and in the limit, 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.

Keyphrases

general metric space data structure nearest neighbor search computational problem euclidian representation improved method high-dimensional euclidian setting particular interest several form vantage point tree difficult search problem euclidian case tree construction euclidian space certain circumstance kd-tree performance theoretical basis several experiment

DMCA