Pivot selection techniques for proximity searching in metric spaces
From MaRDI portal
Publication:4418153
DOI10.1016/S0167-8655(03)00065-5zbMath1047.68037OpenAlexW2078321579MaRDI QIDQ4418153
Edgar Chávez, Benjamin Bustos, Gonzalo Navarro
Publication date: 7 August 2003
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8655(03)00065-5
Searching and sorting (68P10) Database theory (68P15) Pattern recognition, speech recognition (68T10)
Related Items
Probabilistic proximity searching algorithms based on compact partitions ⋮ Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions ⋮ Distance-based index structures for fast similarity search ⋮ Indexability, concentration, and VC theory ⋮ Pivot selection: dimension reduction for distance-based indexing ⋮ Balanced compact clustering for efficient range queries in metric spaces ⋮ Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases ⋮ Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances ⋮ Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers ⋮ Maximum-likelihood approximate nearest neighbor method in real-time image recognition ⋮ Exploiting distance coherence to speed up range queries in metric indexes ⋮ Thinking Ultrametrically, Thinking p-Adically
This page was built for publication: Pivot selection techniques for proximity searching in metric spaces
