Published in

Elsevier, Computational Statistics & Data Analysis, 1(52), p. 43-52

DOI: 10.1016/j.csda.2007.01.016

Links

Tools

Export citation

Search in Google Scholar

A Genetic Algorithm for Irregularly Shaped Spatial Scan Statistics

This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

A new approach is presented for the detection and inference of irregularly shaped spatial clusters, using a genetic algorithm. Given a map divided into regions with corresponding populations at risk and cases, the graph-related operations are minimized by means of a fast offspring generation and efficient evaluation of Kuldorff's spatial scan statistic. A penalty function based on the geometric non-compactness concept is employed to avoid excessive irregularity of cluster geometric shape. The algorithm is an order of magnitude faster and exhibits less variance compared to the simulated annealing scan, and is more flexible than the elliptic scan. It has about the same power of detection as the simulated annealing scan for mildly irregular clusters and is superior for the very irregular ones. An application to breast cancer clusters in Brazil is discussed.