An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters
From MaRDI portal
Recommendations
- Spatial multiresolution cluster detection method
- Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
- A minimal spanning tree algorithm applied to spatial cluster analysis
- Adaptive clustering algorithm based on minimal spanning tree cutting
Cites work
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters
- A spanning tree heuristic for regional clustering
- A spatial scan statistic
- A standardized scan statistic for detecting spatial clusters with estimated parameters
- A test to detect clusters of disease
- An Edge-Weighted Centroidal Voronoi Tessellation Model for Image Segmentation
- Clustering on trees
- Early detection of a change in Poisson rate after accounting for population size effects
- Fast Subset Scan for Spatial Pattern Detection
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Prospective Time Periodic Geographical Disease Surveillance Using a Scan Statistic
Cited in
(6)- An up-to-date review of scan statistics
- A shared-frailty spatial scan statistic model for time-to-event data
- A Bayesian spatial scan statistic for multinomial data
- A minimal spanning tree algorithm applied to spatial cluster analysis
- Spatial multiresolution cluster detection method
- Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes
This page was built for publication: An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663263)