Approximate similarity search: A multi-faceted problem
Authors:
- 1 March 2009
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 7 (1) , 36-48
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Effective Proximity Retrieval by Ordering PermutationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Genetic algorithms for approximate similarity queriesData & Knowledge Engineering, 2007
- Antipole tree indexing to support range search and k-nearest neighbor search in metric spacesIEEE Transactions on Knowledge and Data Engineering, 2005
- Probabilistic proximity searching algorithms based on compact partitionsJournal of Discrete Algorithms, 2004
- CSVD: clustering and singular value decomposition for approximate similarity search in high-dimensional spacesIEEE Transactions on Knowledge and Data Engineering, 2003
- Region proximity in metric spaces and its use for approximate similarity searchACM Transactions on Information Systems, 2003
- Comparing TopkListsSIAM Journal on Discrete Mathematics, 2003
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spacesInformation Processing Letters, 2003
- Nearest Neighbor Queries in Metric SpacesDiscrete & Computational Geometry, 1999
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998