Geometric algorithms for density-based data clustering
From MaRDI portal
Recommendations
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
- Faster \textsc{dbscan} and \textsc{hdbscan} in low-dimensional Euclidean spaces
- Subquadratic approximation algorithms for clustering problems in high dimensional spaces
- Faster DBScan and HDBscan in low-dimensional Euclidean spaces
- Subquadratic approximation algorithms for clustering problems in high dimensional spaces
Cited in
(16)- Region-restricted clustering for geographic data mining
- Mathematical methods of geoinformatics. I: A new approach to clusterization
- Eliminating duplicates under interval and fuzzy uncertainty: an asymptotically optimal algorithm and its geospatial applications
- GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS
- scientific article; zbMATH DE number 45205 (Why is no real title available?)
- scientific article; zbMATH DE number 2042802 (Why is no real title available?)
- scientific article; zbMATH DE number 1912000 (Why is no real title available?)
- scientific article; zbMATH DE number 804595 (Why is no real title available?)
- On the hardness and approximation of Euclidean DBSCAN
- Faster DBScan and HDBscan in low-dimensional Euclidean spaces
- Using the Alpha Geodesic Distance in Shapes K-Means Clustering
- Faster \textsc{dbscan} and \textsc{hdbscan} in low-dimensional Euclidean spaces
- Region-Restricted Clustering for Geographic Data Mining
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
- Subquadratic approximation algorithms for clustering problems in high dimensional spaces
- Robust distance-based clustering with applications to spatial data mining
This page was built for publication: Geometric algorithms for density-based data clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411366)
