Disease surveillance by clustering based on minimal internal distance

Disease surveillance is essential for studying disease spread. An important task in disease surveillance is identifying disease clusters, which are areas of unusually high incidence. In this paper, we formulate the disease surveillance problem as a clustering problem and review some standard techniq...

Full description

Saved in:
Bibliographic Details
Main Authors: Junjie Cao, Kris Baoqian Pan, K. B. P., Kwok-Leung Tsui, Shui-Yee Wong
Format: Conference Proceeding
Language:English
Subjects:
Clustering
Disease Surveillance
Diseases
Graph Theory
Lungs
Scan Statistic
Shape
Solids
Testing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Disease surveillance is essential for studying disease spread. An important task in disease surveillance is identifying disease clusters, which are areas of unusually high incidence. In this paper, we formulate the disease surveillance problem as a clustering problem and review some standard techniques used for clustering problems. Inspired by techniques used in graph theory, we introduce our new method, which is based on a new statistic derived from minimal internal distance in the graph, to solve this problem. Simulated and real lung cancer data from New Mexico are analyzed according to our method, and results are compared with those of the popular spatial scan statistic.
ISSN:2166-563X
2166-5656
DOI:10.1109/PHM.2012.6228842