Rapid Detection of Significant Spatial Clusters (2004)
| Venue: | In KDD |
| Citations: | 40 - 13 self |
BibTeX
@INPROCEEDINGS{Neill04rapiddetection,
author = {Daniel B Neill and Andrew W Moore},
title = {Rapid Detection of Significant Spatial Clusters},
booktitle = {In KDD},
year = {2004},
pages = {256--265}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Given an NN grid of squares, where each square has a count c i j and an underlying population p i j , our goal is to find the rectangular region with the highest density, and to calculate its significance by randomization. An arbitrary density function D, dependent on a region 's total count C and total population P, can be used. For example, if each count represents the number of disease cases occurring in that square, we can use Kulldorff's spatial scan statistic D K to find the most significant spatial disease cluster. A naive approach to finding the maximum density region requires O(N ) time, and is generally computationally infeasible. We present a multiresolution algorithm which partitions the grid into overlapping regions using a novel overlap-kd tree data structure, bounds the maximum score of subregions contained in each region, and prunes regions which cannot contain the maximum density region. For sufficiently dense regions, this method finds the maximum density region in ) time, in practice resulting in significant (20-2000x) speedups on both real and simulated datasets.
Keyphrases
significant spatial cluster rapid detection maximum density region prune region novel overlap-kd tree data structure total population total count simulated datasets spatial scan statistic rectangular region nn grid arbitrary density function disease case multiresolution algorithm significant spatial disease cluster naive approach dense region underlying population maximum score
