Pivot selection techniques for proximity searching in metric spaces
From MaRDI portal
Publication:4418153
Recommendations
- Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
- Pivot selection: dimension reduction for distance-based indexing
- On the Least Cost for Proximity Searching in Metric Spaces
- Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances
Cited in
(16)- Exploiting distance coherence to speed up range queries in metric indexes
- Distance-based index structures for fast similarity search
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions
- Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances
- Maximum-likelihood approximate nearest neighbor method in real-time image recognition
- Balanced compact clustering for efficient range queries in metric spaces
- Indexability, concentration, and VC theory
- Pivot selection: dimension reduction for distance-based indexing
- scientific article; zbMATH DE number 6874634 (Why is no real title available?)
- Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases
- Thinking ultrametrically, thinking p-adically
- On efficient \( k\)-optimal-location-selection query processing in metric spaces
- Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers
- Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
- Probabilistic proximity searching algorithms based on compact partitions
This page was built for publication: Pivot selection techniques for proximity searching in metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418153)