Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers
From MaRDI portal
Publication:5448646
DOI10.1007/978-3-540-77566-9_16zbMath1132.68356OpenAlexW15293447MaRDI QIDQ5448646
Nieves R. Brisaboa, Roberto Uribe, Roberto Solar, Diego Seco, Oscar Pedreira
Publication date: 7 March 2008
Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_16
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Satisfying general proximity/similarity queries with metric trees
- Similarity search. The metric space approach.
- Some approaches to best-match file searching
- An Index Data Structure for Searching in Metric Space Databases
- A Data Structure and an Algorithm for the Nearest Point Problem
- Pivot selection techniques for proximity searching in metric spaces
- Unnamed Item
This page was built for publication: Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers