A sweep-line algorithm for spatial clustering
From MaRDI portal
(Redirected from Publication:1009933)
Recommendations
Cites work
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 2104341 (Why is no real title available?)
- scientific article; zbMATH DE number 928746 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A clustering algorithm based on maximal \(\varTheta\)-distant subtrees
- A new approach to clustering data with arbitrary shapes
- Computational Geometry in C
- Data mining. Concepts and techniques
- Design and implementation of a practical parallel Delaunay algorithm
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Cited in
(6)- scientific article; zbMATH DE number 1983161 (Why is no real title available?)
- scientific article; zbMATH DE number 1870045 (Why is no real title available?)
- DGDCT: A Distributed Grid-Density Based Algorithm for Intrinsic Cluster Detection over Massive Spatial Data
- A practical algorithm for spatial agglomerative clustering
- The use of linked line segments for cluster representation and data reduction
- Multi-objective evolutionary clustering for large-scale dynamic community detection
This page was built for publication: A sweep-line algorithm for spatial clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009933)