A minimal spanning tree algorithm applied to spatial cluster analysis
From MaRDI portal
Recommendations
- A grid clustering technique based on minimal spanning trees
- A spanning tree heuristic for regional clustering
- Adaptive clustering algorithm based on minimal spanning tree cutting
- An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters
- Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
Cites work
Cited in
(13)- A sweep-line algorithm for spatial clustering
- An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters
- ClustGeo: an R package for hierarchical clustering with spatial constraints
- Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
- Clustering with prim's sequential representation of minimum spanning tree
- A grid clustering technique based on minimal spanning trees
- Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes
- scientific article; zbMATH DE number 1163451 (Why is no real title available?)
- An application of the minimal spanning tree approach to the cluster stability problem
- scientific article; zbMATH DE number 1897897 (Why is no real title available?)
- A spanning tree heuristic for regional clustering
- Bayesian space-time partitioning by sampling and pruning spanning trees
- A Nested GLM Framework with Neural Network Encoding and Spatially Constrained Clustering in Non-Life Insurance Ratemaking
This page was built for publication: A minimal spanning tree algorithm applied to spatial cluster analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741498)
