2007
DOI: 10.1073/pnas.0609457104
|View full text |Cite
|
Sign up to set email alerts
|

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 graphtheoretical 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 outbreak… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
26
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 30 publications
(26 citation statements)
references
References 31 publications
0
26
0
Order By: Relevance
“…Hence, the proof follows the same way as performed in [31], replacing the Euclidean distance by Voronoi distance.…”
Section: Methodsmentioning
confidence: 99%
“…Hence, the proof follows the same way as performed in [31], replacing the Euclidean distance by Voronoi distance.…”
Section: Methodsmentioning
confidence: 99%
“…The latter is a powerful tool for characterising geographic variations in risk, and can be used to test explicit hypotheses about putative risk factors. Recent developments that facilitate the efficient detection of irregular cluster shapes have helped to broaden the application of spatial cluster detection methods to micro-spatial scales (Wieland et al, 2007). At these scales, clusters may point to highly localised factors of the physical or social environment that could explain local variations in risk.…”
Section: Discussionmentioning
confidence: 99%
“…Given a set of data points, a Voronoi diagram is a partition of the space into cells, where a cell corresponding to a given data point is a locus of all points of space closest to this data point. Voronoi tessellation is commonly used in various fields of natural and medical sciences (Okabe et al, 1992, 2000; Aurenhammer, 1993; Ebeling and Wiedenmann, 1993; Ramella et al, 2001; Dupanloup et al, 2002; Wieland et al, 2007; Bishnu and Bhattacherjee, 2009; Kao et al, 2010; Edla and Jana, 2011), and in geographic information systems to define the partition cell, or catchment areas containing individual sites by their influence (Okabe et al, 1992, 2000). …”
Section: Introductionmentioning
confidence: 99%