309 554

Cited 16 times in

Optimizing the maximum reported cluster size in the spatial scan statistic for ordinal data

Authors
 Sehwi Kim  ;  Inkyung Jung 
Citation
 PLOS ONE, Vol.12(7) : e0182234, 2017 
Journal Title
PLOS ONE
Issue Date
2017
MeSH
Cluster Analysis ; Computer Simulation ; Models, Statistical ; Monte Carlo Method
Abstract
The spatial scan statistic is an important tool for spatial cluster detection. There have been numerous studies on scanning window shapes. However, little research has been done on the maximum scanning window size or maximum reported cluster size. Recently, Han et al. proposed to use the Gini coefficient to optimize the maximum reported cluster size. However, the method has been developed and evaluated only for the Poisson model. We adopt the Gini coefficient to be applicable to the spatial scan statistic for ordinal data to determine the optimal maximum reported cluster size. Through a simulation study and application to a real data example, we evaluate the performance of the proposed approach. With some sophisticated modification, the Gini coefficient can be effectively employed for the ordinal model. The Gini coefficient most often picked the optimal maximum reported cluster sizes that were the same as or smaller than the true cluster sizes with very high accuracy. It seems that we can obtain a more refined collection of clusters by using the Gini coefficient. The Gini coefficient developed specifically for the ordinal model can be useful for optimizing the maximum reported cluster size for ordinal data and helpful for properly and informatively discovering cluster patterns.
Files in This Item:
T201702717.pdf Download
DOI
10.1371/journal.pone.0182234
Appears in Collections:
1. College of Medicine (의과대학) > Dept. of Biomedical Systems Informatics (의생명시스템정보학교실) > 1. Journal Papers
Yonsei Authors
Jung, Inkyung(정인경) ORCID logo https://orcid.org/0000-0003-3780-3213
URI
https://ir.ymlib.yonsei.ac.kr/handle/22282913/160597
사서에게 알리기
  feedback

qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse

Links