Pivot selection: dimension reduction for distance-based indexing
DOI10.1016/J.JDA.2011.10.004zbMATH Open1246.68113OpenAlexW1963759274MaRDI QIDQ450522FDOQ450522
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
Recommendations
Factor analysis and principal components; correspondence analysis (62H25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Database theory (68P15)
Cites Work
- Measuring the strangeness of strange attractors
- Foundations of multidimensional and metric data structures.
- Title not available (Why is that?)
- Data dimensionality estimation methods: A survey.
- A Best Possible Heuristic for the k-Center Problem
- Satisfying general proximity/similarity queries with metric trees
- Multidimensional binary search trees used for associative searching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pivot selection techniques for proximity searching in metric spaces
- Database Theory - ICDT 2005
Cited In (5)
This page was built for publication: Pivot selection: dimension reduction for distance-based indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450522)