Solving similarity joins and range queries in metric spaces with the list of twin clusters
From MaRDI portal
(Redirected from Publication:1013069)
Recommendations
- scientific article; zbMATH DE number 1975047
- Balanced compact clustering for efficient range queries in metric spaces
- MICAI 2004: Advances in Artificial Intelligence
- Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers
- Optimale Dimensionswahl bei der Bearbeitung des Similarity Join. (Optimal dimension election in case of the similarity join.)
Cites work
- A Data Structure and an Algorithm for the Nearest Point Problem
- A vector space model for automatic indexing
- Computational Science – ICCS 2005
- Dynamic spatial approximation trees
- Fixed queries array: A fast and economical data structure for proximity searching
- Foundations of multidimensional and metric data structures.
- scientific article; zbMATH DE number 437556 (Why is no real title available?)
- scientific article; zbMATH DE number 1945795 (Why is no real title available?)
- scientific article; zbMATH DE number 1975047 (Why is no real title available?)
- scientific article; zbMATH DE number 1754502 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- On the Least Cost for Proximity Searching in Metric Spaces
- Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
- Satisfying general proximity/similarity queries with metric trees
- Similarity search. The metric space approach.
- Some approaches to best-match file searching
- Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
Cited in
(4)
This page was built for publication: Solving similarity joins and range queries in metric spaces with the list of twin clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013069)