Multi-objective dynamic programming for spatial cluster detection
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.
KeywordsArbitrarily shaped spatial cluster Chagas’ disease Dynamic programming Multi-objective optimization Spatial scan statistic
The authors thank the Editor and Reviewers for their thoughtful comments. This work was found by Brazilian agencies CNPq, Fapemig and CAPES, and partially supported by iCIS (CENTRO-07-ST24-FEDER-002003).
- Beier R, Röglin H, Vöcking B (2007) The smoothed number of pareto optimal solutions in bicriteria integer optimization. Integer programming and combinatorial optimization. Lecture Notes in Computer Science. Springer, Berlin, vol 4513, pp 53–67Google Scholar
- Cançado AL (2009) Spatial clusters detection through multi-objective optimization. (in portuguese). Ph.D. thesis, Universidade Federal de Minas GeraisGoogle Scholar
- García-Alonso Carlos R, Pérez-Naranjo Leonor M, Fernández-Caballero Juan C (2011) Multiobjective evolutionary algorithms to identify highly autocorrelated areas: the case of spatial distribution in financially compromised farms. Annals of operations research, pp 1–16Google Scholar
- Glaz J, Pozdnyakov V, Wallenstein S (eds) (2009) Scan statistics: methods and applications. Birkhuser BostonGoogle Scholar
- Gupta P, Agarwal V, Varshney M (2008) Design and analysis of algorithms. PHI Learning Private Limited, DelhiGoogle Scholar
- Kulldorff M (1999) Spatial scan statistics: models, calculations and applications. In: Glaz J, & Balakrishnan N (eds) Scan statistics and applications. Birkhauser, Boston, pp 303–322Google Scholar
- Kulldorff M, Heffernan R, Hartman J, Assunção R, Mostashari F (2005) A space time permutation scan statistic for disease outbreak detection. Plos med 2(3):Google Scholar
- Lawson AB (2009) Bayesian disease mapping: hierarchical modeling in spatial epidemiology. CRC Press, Boca RatonGoogle Scholar
- Neill DB (2008) Fast and flexible outbreak detection by linear-time subset scanning. Adv Dis Surveill 5:48Google Scholar
- Speakman S, Neill DB (2010) Fast graph scan for scalable detection of arbitrary connected clusters. Proceedings of the 2009 international society for disease surveillance annual conferenceGoogle Scholar
- Tango T, Takahashi K (2005) A flexibly shaped spatial scan statistic for detecting clusters. Int J Health Geogr 4(11):1–15Google Scholar