Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes

DOI10.1073/pnas.0609457104zbMath1156.62369OpenAlexW1984505857WikidataQ35839619 ScholiaQ35839619MaRDI QIDQ3615231

John S. Brownstein, Kenneth D. Mandl, Bonnie Berger, Shannon C. Wieland

Publication date: 18 March 2009

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.0609457104

zbMATH Keywords

graph theorybiosurveillancedisease cluster detection

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of graph theory (05C90)

Related Items (4)

Multi-objective approach for multiple clusters detection in data points events ⋮ Nonparametric dependence modeling via cluster analysis: A financial contagion application ⋮ An up-to-date review of scan statistics ⋮ A novel access control and energy-saving resource allocation scheme for D2D communication in 5G networks

Cites Work

• A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters
• Bayesian Partitioning for Estimating Disease Risk
• A spatial scan statistic
• Diffusion-based method for producing density-equalizing maps

This page was built for publication: Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes