.png){kind=icon}
.png){kind=icon}
Return
Multi-objective dynamic programming for spatial cluster detection
.png){kind=icon}
PRE
AI
DOI：10.1007/s10651-014-0302-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The detection and inference of arbitrarily shaped spatial clusters in aggregated geographical areas is described here as a multi-objective combinatorial optimization problem. A multi-objective dynamic programming algorithm, the Geo Dynamic Scan, is proposed for this formulation, finding a collection of Pareto-optimal solutions. It takes into account the geographical proximity between areas, thus allowing a disconnected subset of aggregated areas to be included in the efficient solutions set. It is shown that the collection of efficient solutions generated by this approach contains all the solutions maximizing the spatial scan statistic. The plurality of the efficient solutions set is potentially useful to analyze variations of the most likely cluster and to investigate covariates. Numerical simulations are conducted to evaluate the algorithm. A study case with Chagas' disease clusters in Brazil is presented, with covariate analysis showing strong correlation of disease occurrence with environmental data.
Keywords:
Arbitrarily shaped spatial cluster
Chagas' disease
Dynamic programming
Multi-objective optimization
Spatial scan statistic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
1.8
Papers:
1.0K
Citations:
1.1K
Organization
View more organizations