Pivot selection: dimension reduction for distance-based indexing

DOI10.1016/J.JDA.2011.10.004zbMath1246.68113OpenAlexW1963759274MaRDI 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

zbMATH Keywords

dimension reductionmetric spaceintrinsic dimensionpivot selectionpivot space modelsimilarity query

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

A parallel computing framework for big data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Pivot selection: dimension reduction for distance-based indexing