Intrinsic dimensionality

Authors:
Vladimir Pestov
Affiliations:
University of Ottawa, Ottawa, Ontario, Canada
Venue:
SIGSPATIAL Special
Year:
2010

Citing 4
Cited 0

Searching in metric spaces

ACM Computing Surveys (CSUR)
Navigating nets: simple algorithms for proximity search

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial Framework for Similarity Search

SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Curse of Dimensionality in Pivot Based Indexes

SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Nature of the concept. Intrinsic dimensionality of data does not refer to a single well-defined parameter, but rather a diverse family of parameters associated to a given similarity workload (X, d, U) and allowing to gauge the performance of various indexing schemes for similarity-based information retrieval.