Pivot selection algorithms in metric spaces: a survey and experimental study
- 11 August 2021
- journal article
- research article
- Published by Springer Nature in The VLDB Journal
- Vol. 31 (1) , 23-47
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Pivot selection: Dimension reduction for distance-based indexingJournal of Discrete Algorithms, 2012
- Optimal Pivot Selection Method Based on the Partition and the Pruning Effect for Metric Space IndexesIEICE Transactions on Information and Systems, 2011
- Reference-based indexing for metric spaces with costly distance measuresThe VLDB Journal, 2007
- The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficientThe VLDB Journal, 2006
- A compact space decomposition for effective metric indexingPattern Recognition Letters, 2005
- Pivot selection techniques for proximity searching in metric spacesPattern Recognition Letters, 2003
- Searching in metric spacesACM Computing Surveys, 2001
- Distance-based indexing for high-dimensional metric spacesACM SIGMOD Record, 1997
- A fast branch & bound nearest neighbour classifier in metric spacesPattern Recognition Letters, 1996
- A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirementsPattern Recognition Letters, 1994