Pivot selection: dimension reduction for distance-based indexing
From MaRDI portal
Publication:450522
DOI10.1016/j.jda.2011.10.004zbMath1246.68113MaRDI QIDQ450522
Rui Mao, Daniel P. Miranker, Willard L. Miranker
Publication date: 13 September 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.10.004
dimension reduction; metric space; intrinsic dimension; pivot selection; pivot space model; similarity query
62H25: Factor analysis and principal components; correspondence analysis
68P15: Database theory
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cites Work
- Measuring the strangeness of strange attractors
- Satisfying general proximity/similarity queries with metric trees
- Data dimensionality estimation methods: A survey.
- Foundations of multidimensional and metric data structures.
- A Best Possible Heuristic for the k-Center Problem
- Multidimensional binary search trees used for associative searching
- Pivot selection techniques for proximity searching in metric spaces
- Database Theory - ICDT 2005
- Unnamed Item
- Unnamed Item
- Unnamed Item