Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

Spatial cluster detection using dynamic programming.

UNSPECIFIED (2012) Spatial cluster detection using dynamic programming. BMC medical informatics and decision making, 12 (1). 22 - ?.

[img]
Preview
PDF
Published Version
Available under License : See the attached license file.

Download (1MB) | Preview
[img] Plain Text (licence)
Available under License : See the attached license file.

Download (1kB)

Abstract

The task of spatial cluster detection involves finding spatial regions where some property deviates from the norm or the expected value. In a probabilistic setting this task can be expressed as finding a region where some event is significantly more likely than usual. Spatial cluster detection is of interest in fields such as biosurveillance, mining of astronomical data, military surveillance, and analysis of fMRI images. In almost all such applications we are interested both in the question of whether a cluster exists in the data, and if it exists, we are interested in finding the most accurate characterization of the cluster. We present a general dynamic programming algorithm for grid-based spatial cluster detection. The algorithm can be used for both Bayesian maximum a-posteriori (MAP) estimation of the most likely spatial distribution of clusters and Bayesian model averaging over a large space of spatial cluster distributions to compute the posterior probability of an unusual spatial clustering. The algorithm is explained and evaluated in the context of a biosurveillance application, specifically the detection and identification of Influenza outbreaks based on emergency department visits. A relatively simple underlying model is constructed for the purpose of evaluating the algorithm, and the algorithm is evaluated using the model and semi-synthetic test data. When compared to baseline methods, tests indicate that the new algorithm can improve MAP estimates under certain conditions: the greedy algorithm we compared our method to was found to be more sensitive to smaller outbreaks, while as the size of the outbreaks increases, in terms of area affected and proportion of individuals affected, our method overtakes the greedy algorithm in spatial precision and recall. The new algorithm performs on-par with baseline methods in the task of Bayesian model averaging. We conclude that the dynamic programming algorithm performs on-par with other available methods for spatial cluster detection and point to its low computational cost and extendability as advantages in favor of further research and use of the algorithm.


Share

Citation/Export:
Social Networking:
Share |

Details

Item Type: Article
Status: Published
Date: 3 October 2012
Date Type: Publication
Journal or Publication Title: BMC medical informatics and decision making
Volume: 12
Number: 1
Page Range: 22 - ?
DOI or Unique Handle: 10.1186/1472-6947-12-22
Schools and Programs: Dietrich School of Arts and Sciences > Intelligent Systems
School of Medicine > Biomedical Informatics
Refereed: Yes
Date Deposited: 20 Oct 2016 18:26
Last Modified: 05 Jan 2019 14:55
URI: http://d-scholarship.pitt.edu/id/eprint/29938

Metrics

Monthly Views for the past 3 years

Plum Analytics

Altmetric.com


Actions (login required)

View Item View Item