Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions

Within a mathematically rigorous model, we analyse the curse of dimensionality for deterministic exact similarity search in the context of popular indexing schemes: metric trees. The datasets X are sampled randomly from a domain Ω , equipped with a distance, ρ , and an underlying probability distrib...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 66; no. 2; pp. 310 - 328
Main Author:	Pestov, Vladimir
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.06.2013 Springer
Subjects:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data processing. List processing. Character string processing Data Structures and Information Theory Exact sciences and technology Mathematics of Computing Memory organisation. Data processing Software Theoretical computing Theory of Computation Algorithms and data structures Algorithm performance Vapnik-Chernonenkis theory Indexing schemes Similarity search Lower bound Nearest neighbour Automatic classification Dimensionality Tree(graph) Probability distribution Modeling Decision function Lipschitz function Probability learning Metric Asymptotic approximation Data structure Deterministic approach Indexing
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!