Approximate similarity search: a multi-faceted problem
From MaRDI portal
Publication:1013071
DOI10.1016/J.JDA.2008.09.014zbMATH Open1162.68010OpenAlexW2026406865MaRDI QIDQ1013071FDOQ1013071
Authors: Marco Patella, Paolo Ciaccia 
Publication date: 16 April 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2008.09.014
Recommendations
Cites Work
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Comparing Top k Lists
- Nearest neighbor queries in metric spaces
- Title not available (Why is that?)
- Statistical profile estimation in database systems
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
- Probabilistic proximity searching algorithms based on compact partitions
- Title not available (Why is that?)
- On the differential simplicity of affine rings
Cited In (12)
- Nearest neighbors methods for support vector machines
- Title not available (Why is that?)
- Robust Quantization for General Similarity Search
- Distance-based index structures for fast similarity search
- Part special issue: Best papers from the 3rd international conference on similarity search and applications (SISAP 2010), Istanbul, Turkey, September 18--19, 2010
- Title not available (Why is that?)
- Index structures for fast similarity search for real vectors. II
- On spaced seeds for similarity search
- Probabilistic proximity searching algorithms based on compact partitions
- Indexing schemes for similarity search: an illustrated paradigm
- Title not available (Why is that?)
- Cutoff algorithm for various measures of similarity in information retrieval
This page was built for publication: Approximate similarity search: a multi-faceted problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013071)
