An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Some approaches to best-match file searching
Communications of the ACM
ACM Computing Surveys (CSUR)
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Fast Nearest-Neighbor Search in Dissimilarity Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity Search without Tears: The OMNI Family of All-purpose Access Methods
Proceedings of the 17th International Conference on Data Engineering
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Proximity Matching Using Fixed-Queries Trees
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Probabilistic proximity searching algorithms based on compact partitions
Journal of Discrete Algorithms - SPIRE 2002
A pivot-based index structure for combination of feature vectors
Proceedings of the 2005 ACM symposium on Applied computing
Exploiting distance coherence to speed up range queries in metric indexes
Information Processing Letters
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Engineering efficient metric indexes
Pattern Recognition Letters
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
CM-tree: A dynamic clustered index for similarity search in metric databases
Data & Knowledge Engineering
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
CSV: visualizing and mining cohesive subgraphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Reference-based indexing for metric spaces with costly distance measures
The VLDB Journal — The International Journal on Very Large Data Bases
Scalability comparison of Peer-to-Peer similarity search structures
Future Generation Computer Systems
Caching content-based queries for robust and efficient image retrieval
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Analyzing Metric Space Indexes: What For?
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Efficient Similarity Search by Reducing I/O with Compressed Sketches
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Curse of Dimensionality in Pivot Based Indexes
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Metric Index: An Efficient and Scalable Solution for Similarity Search
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Optimal Pivots to Minimize the Index Size for Metric Access Methods
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Maximal metric margin partitioning for similarity search indexes
Proceedings of the 18th ACM conference on Information and knowledge management
Exploiting distance coherence to speed up range queries in metric indexes
Information Processing Letters
Bulk construction of dynamic clustered metric trees
Knowledge and Information Systems
Pivot learning for efficient similarity search
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part III
Improving the performance of M-tree family by nearest-neighbor graphs
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Clustering-based similarity search in metric spaces with sparse spatial centers
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Indexability, concentration, and VC theory
Proceedings of the Third International Conference on SImilarity Search and APplications
Dimension reduction for distance-based indexing
Proceedings of the Third International Conference on SImilarity Search and APplications
On locality sensitive hashing in metric spaces
Proceedings of the Third International Conference on SImilarity Search and APplications
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On (not) indexing quadratic form distance by metric access methods
Proceedings of the 14th International Conference on Extending Database Technology
Information Systems
Large scale disk-based metric indexing structure for approximate information retrieval by content
Proceedings of the 1st Workshop on New Trends in Similarity Search
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
A fast pivot-based indexing algorithm for metric spaces
Pattern Recognition Letters
Selecting vantage objects for similarity indexing
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Nearest neighbours search using the PM-Tree
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Indexing dense nested metric spaces for efficient similarity search
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Indexability, concentration, and VC theory
Journal of Discrete Algorithms
Pivot selection: Dimension reduction for distance-based indexing
Journal of Discrete Algorithms
Adapting metric indexes for searching in multi-metric spaces
Multimedia Tools and Applications
Similarity caching in large-scale image retrieval
Information Processing and Management: an International Journal
Dynamic optimization of queries in pivot-based indexing
Multimedia Tools and Applications
Reduction of distance computations in selection of pivot elements for balanced GHT structure
MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
Flexible and efficient string similarity search with alignment-space transform
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Hi-index | 0.10 |
With few exceptions, proximity search algorithms in metric spaces based on the use of pivots select them at random among the objects of the metric space. However, it is well known that the way in which the pivots are selected can drastically affect the performance of the algorithm. Between two sets of pivots of the same size, better chosen pivots can largely reduce the search time. Alternatively, a better chosen small set of pivots (requiring much less space) can yield the same efficiency as a larger, randomly chosen, set. We propose an efficiency measure to compare two pivot sets, combined with an optimization technique that allows us to select good sets of pivots. We obtain abundant empirical evidence showing that our technique is effective, and it is the first that we are aware of in producing consistently good results in a wide variety of cases and in being based on a formal theory. We show that good pivots are outliers, but that selecting outliers does not ensure that good pivots are selected.