scientific article; zbMATH DE number 1947400
From MaRDI portal
Publication:4411366
zbMATH Open1019.68602MaRDI QIDQ4411366FDOQ4411366
Michiel Smid, Bin Xu, Danny Z. Chen
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610284.htm
Title of this publication is not available (Why is that?)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (9)
- Using the Alpha Geodesic Distance in Shapes K-Means Clustering
- Mathematical methods of geoinformatics. I: A new approach to clusterization
- GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS
- Title not available (Why is that?)
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust distance-based clustering with applications to spatial data mining
Recommendations
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING 👍 👎
- Faster DBSCAN and 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 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411366)
