title: Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes.
abstract: Existing disease cluster detection methods cannot detect clusters of all shapes and sizes or identify highly irregular sets that overestimate the true extent of the cluster. We introduce a graph-theoretical method for detecting arbitrarily shaped clusters based on the Euclidean minimum spanning tree of cartogram-transformed case locations, which overcomes these shortcomings. The method is illustrated by using several clusters, including historical data sets from West Nile virus and inhalational anthrax outbreaks. Sensitivity and accuracy comparisons with the prevailing cluster detection method show that the method performs similarly on approximately circular historical clusters and greatly improves detection for noncircular clusters.
authors.affiliation: Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139-4307, USA.
authors.forename: Shannon C
authors.initials: SC
authors.lastname: Wieland
authors.forename: John S
authors.initials: JS
authors.lastname: Brownstein
authors.forename: Bonnie
authors.initials: B
authors.lastname: Berger
authors.forename: Kenneth D
authors.initials: KD
authors.lastname: Mandl
mesh_terms: D000881:Anthrax / Q000453:epidemiology* / Q000382:microbiology / Q000473:pathology; D001900:Boston / Q000453:epidemiology; D016000:Cluster Analysis; D009518:New York / Q000453:epidemiology; D012426:Russia / Q000453:epidemiology; D012680:Sensitivity and Specificity; D013997:Time Factors; D014901:West Nile Fever / Q000453:epidemiology* / Q000473:pathology / Q000821:virology