Robust distance-based clustering with applications to spatial data mining
From MaRDI portal
Recommendations
- Data structures for minimization of total within-group distance for spatio-temporal clustering
- An efficient K-medoids-Based algorithm using previous medoid index, triangular inequality elimination criteria, and partial distance search
- Geometric algorithms for density-based data clustering
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
- scientific article; zbMATH DE number 1912000
Cited in
(15)- Region-restricted clustering for geographic data mining
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- Criteria on proximity graphs for boundary extraction and spatial clustering
- AUTOCLUST+: automatic clustering of point-data sets in the presence of obstacles
- Hyperpath centers
- scientific article; zbMATH DE number 1285875 (Why is no real title available?)
- An efficient K-medoids-Based algorithm using previous medoid index, triangular inequality elimination criteria, and partial distance search
- Multi-level clustering and reasoning about its clusters using region connection calculus
- Efficiently computing weighted proximity relationships in spatial databases
- scientific article; zbMATH DE number 1870045 (Why is no real title available?)
- Data structures for minimization of total within-group distance for spatio-temporal clustering
- scientific article; zbMATH DE number 1912000 (Why is no real title available?)
- Efficient computation of a proximity matching in spatial databases
- Reverse nearest neighbor clustering method of spatial database
- Inductive Logic Programming
This page was built for publication: Robust distance-based clustering with applications to spatial data mining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945909)
