 Methodology
 Open Access
 Published:
A flexibly shaped spatial scan statistic for detecting clusters
International Journal of Health Geographicsvolume 4, Article number: 11 (2005)
Abstract
Background
The spatial scan statistic proposed by Kulldorff has been applied to a wide variety of epidemiological studies for cluster detection. This scan statistic, however, uses a circular window to define the potential cluster areas and thus has difficulty in correctly detecting actual noncircular clusters. A recent proposal by Duczmal and Assunção for detecting noncircular clusters is shown to detect a cluster of very irregular shape that is much larger than the true cluster in our experiences.
Methods
We propose a flexibly shaped spatial scan statistic that can detect irregular shaped clusters within relatively small neighborhoods of each region. The performance of the proposed spatial scan statistic is compared to that of Kulldorff's circular spatial scan statistic with Monte Carlo simulation by considering several circular and noncircular hotspot cluster models. For comparison, we also propose a new bivariate power distribution classified by the number of regions detected as the most likely cluster and the number of hotspot regions included in the most likely cluster.
Results
The circular spatial scan statistics shows a high level of accuracy in detecting circular clusters exactly. The proposed spatial scan statistic is shown to have good usual powers plus the ability to detect the noncircular hotspot clusters more accurately than the circular one.
Conclusion
The proposed spatial scan statistic is shown to work well for small to moderate cluster size, up to say 30. For larger cluster sizes, the method is not practically feasible and a more efficient algorithm is needed.
Background
The question of whether disease cases are clustered in space has received considerable attention in the literature [1–4]. Although many statistical tests for disease clusters have been proposed, most tests suffer from multiple testing problems due to one or two unknown parameters that must be set prior to their applications. For example, Cuzick and Edwards's procedure [5] has an unknown number k of nearestneighbours and Besag and Newell's method [6] has an unknown number of cases k for the size of the cluster. As far as we know, the spatial scan statistic proposed by Kulldorff [7, 8] and Tango's maximized excess events test [9, 10] are exceptions and take multiple testing into account in the sense that we have only to specify the maximum possible cluster size. Especially, Kulldorff's circular spatial scan statistic has been applied to a wide variety of epidemiological studies for cluster detection (for example, see [11–13]). In recent power comparisons of disease clustering tests, his scan statistic has been shown to be the most powerful for detecting localized clusters [14, 15]. It should be noted, however, that the power estimates provided reflect the "power to reject the null hypothesis for whatever reason" and that the probability of both rejecting the null hypothesis and detecting the true cluster correctly is a different matter.
As the circular spatial scan statistic uses a "circular window" with variable size to define the potential cluster area, it is difficult to correctly detect noncircular clusters such as those along a river. Most geographical areas are noncircular. Furthermore, in our experience in applying SaTScan program [16] to various data, even if the null hypothesis is rejected, the circular spatial scan statistic tends to detect a larger cluster than the true cluster by absorbing surrounding regions where there is no elevated risk. It should be noted that although Kulldorff originally made no assumptions about the shape of the scanning window in his paper [8], a circular scanning window has been used in almost all purely spatial applications especially for the availability of software and computational speed.
Recently, Patil and Taillie [17] and Duczmal and Assunção [18] proposed noncircular spatial scan statistics based on the likelihood ratio test formulated in the same way as in the circular spatial scan statistic. To avoid undertaking computationally infeasible searches, they considered different approaches. Patil and Taillie [17] used the notion of "upper level set" to reduce the size of windows to be scanned and proposed "upper level set scan statistic". However, they do not discuss how to select the level g which defines the upper level set and do not provide any illustrations of their method nor any results of comparison with the circular scan statistic. Duczmal and Assunção [18], on the other hand, have applied a simulated annealing method in which they try to examine only the most promising windows using a graphbased algorithm to obtain the local maxima of a certain likelihood function over a subset of the collection of all the connected regions. Their method seems to be very complicated but they do not show any programmable procedure of their method. In our experience using their program (personal communication to Professor Duczmal via email) which is executable with the Borland C++ Builder 6, their scan statistic, in most cases, detected a cluster of peculiar shape that was much larger than the true cluster by absorbing not only surrounding regions with nonelevated risk but also faraway regions with nonelevated risk. An example of such properties of Duczmal and Assunção's procedure is shown later in comparison with the circular spatial scan statistic and the proposed flexible spatial scan statistic. That is why we did not include both the Patil and Taille method and Duczmal and Assunção's procedure in our simulation for comparison.
In this paper, we propose an alternative flexibly shaped spatial scan statistic ('flexible spatial scan statistic' hereafter) in which the detected cluster is allowed to be flexible in shape while at the same time the cluster is confined within relatively small neighborhoods of each region. The performance of the flexible spatial scan statistic is compared with that of the circular spatial scan statistic using Monte Carlo simulation. In comparing performance we examined not only the usual power but also the newly introduced bivariate power distribution classified by the number of regions detected as the most likely cluster and the number of hotspot regions included in the most likely cluster. The proposed flexible spatial scan statistic is illustrated with some simulated disease maps for the Tokyo Metropolitan area.
Methods
Consider the situation where an entire study area is divided into m regions (for example, county, enumeration districts, etcetera). The number of cases in the region i is denoted by the random variable N_{ i }with observed value n_{ i }, i = 1, ..., m. Under the null hypothesis H_{0} of no clustering, the N_{ i }are independent Poisson variables such that
H_{0} : E(N_{ i }) = ξ_{ i }, N_{ i }~ Pois(ξ_{ i }), i = 1, ..., m (1)
where Pois(e) denotes Poisson distribution with mean e and the ξ_{ i }are the null expected number of cases in the region i. To specify the geographical position of each region, we will use the coordinates of the administrative population centroid.
Under this situation, the circular spatial scan statistic imposes a circular window Z on each centroid. For any of those centroids, the radius of the circle varies from zero to a preset maximum distance d or a preset maximum number of regions K to be included in the cluster. If the window contains the centroid of a region, then that whole region is included in the window. In total, a very large number of different but overlapping circular windows are created, each with a different location and size, and each being a potential cluster. Let Z_{ ik }, k = 1,..., K, denote the window composed by the (k  1)nearest neighbours to region i. Then, all the windows to be scanned by the circular spatial scan statistic are included in the set
Z_{1} = {Z_{ ik } 1 ≤ i ≤ m, 1 ≤ k ≤ K} (2)
A flexible scan statistic we propose, on the other hand, imposes an irregularly shaped window Z on each region by connecting its adjacent regions. For any given region i, we create the set of irregularly shaped windows with length k consisting of k connected regions including i and let k moves from 1 to the preset maximum K. To avoid detecting a cluster of unlikely peculiar shape, the connected regions are restricted as the subsets of the set of regions i and (K  1)nearest neighbours to the region i where K is a prespecified maximum length of cluster. In total, as in the circular spatial scan statistic, a very large number of different but overlapping arbitrarily shaped windows are created. Let Z_{ik(j)}, j = 1,..., j_{ ik }denote the jth window which is a set of k regions connected starting from the region i, where j_{ ik }is the number of j satisfying Z_{ik(j) }⊆ Z_{ ik }for k = 1,..., K. Then, all the windows to be scanned are included in the set
Z_{2} = {Z_{ik(j) } 1 ≤ i ≤ m, 1 ≤ k ≤ K, 1 ≤ j ≤ j_{ ik }} (3)
In other words, for any given region i, the circular spatial scan statistic consider K concentric circles, whereas the flexible scan statistic consider K concentric circles plus all the sets of connected regions (including the single region i) whose centroids are located within the Kth largest concentric circle. So, the size of Z_{2} is far larger than that of Z_{1} which is at most mK. Details of the algorithm that we adopted to find all these arbitrarily shaped windows within a prespecified maximum length K are given in the Appendix.
Under the alternative hypothesis, there is at least one window Z for which the underlying risk is higher inside the window when compared with outside. In other words, we are considering the following hypothesis:
H_{0} : E(N(Z)) = ξ(Z), for all Z, H_{1} : E(N(Z)) > ξ(Z), for some Z (4)
where N() and ξ() denote the random number of cases and the null expected number of cases within the specified window, respectively. For each window, it is possible to compute the likelihood to observe the observed number of cases within and outside the window, respectively. Under the Poisson assumption, the test statistic, which was constructed with the likelihood ratio test [8], is given by
where Z^{c}indicates all the regions outside the window Z, and n() denotes the observed number of cases within the specified window and I() is the indicator function. The window Z* that attains the maximum likelihood is defined as the most likely cluster (MLC). To find the distribution of the test statistic under the null hypothesis, Monte Carlo hypothesis testing [19] is required. In this paper, pvalue of the test is based upon the null distribution of likelihood ratio test statistic with a large number (we used 999) of Monte Carlo replications of the data set generated under the null hypothesis. It should be noted that, in the same manner as the circular spatial scan statistic, the flexible spatial scan statistic is also able to locate secondary clusters that do not overlap the most likely cluster but are still statistically significant.
Results
Illustrations and powers
In this section, we will compare the flexible spatial scan statistic with the circular spatial scan statistic. As an entire study population, we will use m = 113 regions comprising the wards, cities and villages in the area of Tokyo Metropolis and Kanagawa prefecture in Japan (Figure 1). The variability of regional populations for m = 113 regions is: 25 percentile = 56, 704, median = 142, 320 and 75 percentile = 200, 936.
Hotspot clusters
We will consider the following four hotspot clusters where the expected total number of cases
is set to be 200 under the null hypothesis.

1.
Cluster A = {14, 15, 20}

2.
Cluster B = {14, 15, 20, 26}

3.
Cluster C = {14, 15, 26, 27}

4.
Cluster D = {73, 74, 75, 76, 78}
where the region included in a hotspot cluster is called a "hotspot region" (hotspot region numbers are shown in Figure 1). The relative risk within any cluster R is set to three, i.e.,
H_{1} : N(R) ~ Pois(θ ξ(R)), θ = 3.0 (6)
The cluster A is considered here as an example of a circular cluster that can be in the set of the circular windows and is expected to be identified by the circular spatial scan statistic more often than by the flexible spatial scan statistic. The other clusters are examples of noncircular clusters that are not in the set of the circular windows and thus cannot be identified correctly by the circular spatial scan statistics. For example, consider the region i_{0} = 15 as the starting region and the set of (K  1)nearest neighbours to the region 15, which is listed as follows in the ascending order of distance from the region 15:
15, 14, 20, 12, 4, 26, 13, 27, 16, 40, 19, 42, 10,...,
In this case, circular windows are {15}, {15, 14}, {15, 14, 20}, {15, 14, 20, 12}, ... When the starting region is 14 or 20, the corresponding set of (K  1)nearest neighbours is
14, 15, 20, 4, 16, 13, 19, 12, 5, 1, 17, 10, 26, 3, 27,...,
and
20, 14, 15, 19, 16, 4, 17, 26, 40, 13, 5, 12, 1, 27,...,
respectively. In both cases, cluster B and C are easily found to be not in the set of circular windows. The cluster D is considered as an example of a long and narrow cluster as is shown in Figure 1.
Illustrative example
As an illustration, we will apply the circular spatial scan statistic, the flexible spatial scan statistic and Duczmal and Assunção's spatial scan statistic to the disease map shown in Figure 2 which is a random sample of n = 235 cases assuming the cluster model C. Circles are drawn only for the regions whose observedexpected ratio (standardized risk ratio) is statistically significantly larger than 1 at α = 0.05. The radius of the circles is set inversely proportional to the upper tail pvalue. The number shown in Figure 2 indicates the region number. Figure 2 obviously suggests the clusters occurring in the area including regions {14, 15, 26, 27, 33}.
Before applying the three spatial scan statistics, we have to specify a common maximum length K for the most likely cluster. This makes comparisons to a certain extent fair. In this example, we chose two kinds of maximum length K = 15 and K = 20 since it is not unreasonable to assume that an actual cluster size will be less than one third or one fourth of the size of the whole study area.
Irrespective of the value of K, the circular spatial scan statistic detected the regions {14, 15} as MLC with log likelihood ratio = 20.1, p = 1/(999 + 1) = 0.001 and the estimated relative risk is = 3.47. This is shown in Figure 3(a). The flexible spatial scan statistic, regardless of the value K, detected the regions {14, 15, 26, 27, 33} as MLC with log likelihood ratio = 29.7, p = 0.001 and the estimated relative risk is = 3.41. This is shown in Figure 3(b). Duczmal and Assunção's method, on the other hand, detected a cluster of peculiar shape that is much larger than the true cluster. In the case of K = 15, their scan statistic detected an area consisting of K = 15 connected regions {14, 15, 24, 26, 27, 31, 32, 33, 48, 54, 69, 77, 78, 90, 110 } as MLC with log likelihood ratio = 31.8, p = 0.001 and the estimated relative risk is = 2.40. This is shown in Figure 4(a). Figure 4(b) shows the most likely cluster {14, 15, 26, 27, 31, 32, 33, 48, 60, 61, 62, 67, 69, 77, 78, 80, 89, 90, 108, 110 } detected by Duczmal and Assunção's scan statistic for K = 20 where the length of MLC is also the same as K = 20 and log likelihood ratio = 36.0, p = 0.001 and the estimated relative risk is = 2.26. In the case of K = 15, the results of the three scan statistics are summarized in Table 1. Although the most likely cluster detected by Duczmal and Assunção's scan statistic has the largest log likelihood ratio among three scan statistics, it has detected MLC surprisingly larger than the true cluster.
Using a PC(Windows XP, CPU pentium 4, 3.2 GHz), the execution time of the flexible spatial scan statistic in this example is 14 seconds for K = 15 and 379 seconds for K = 20 which is certainly greater than that for the circular spatial scan statistic (less than 1 second for both K = 15 and K = 20).
Power comparison
In the power comparison, we chose K = 15. To compare the power of the flexible spatial scan statistic with that of the circular spatial scan statistic based upon Monte Carlo simulation, we will introduce a new bivariate power distribution P(l, s) classified by the length l of the significant MLC and the number s of hotspot regions included in the most likely cluster:
where l ≥ 1 and s ≥ 0. Based on P(l, s), we examined the following powers,
1. the usual power, i.e., P(+,+) = ∑_{l≥1 }∑_{s≥0 }P(l, s),
2. the joint power P(l, s), especially P(s*, s*) where s* is the length of the hotspot cluster assumed in the simulation.
3. the marginal power distribution of s(≥ 0), P(+, s) = ∑_{l≥1 }P(l, s) and its conditional power P(+, s)/P(+,+),
4. the marginal power distribution of l(≥ 1), P(l, +) = ∑_{s≥0 }P(l, s).
The powers are calculated for tests of nominal α levels of 0.05 and for the expected total number of cases 200 under the null hypothesis, which are based on Monte Carlo simulation using Poisson random numbers. For each simulation, 1,000 trials were carried out. The resultant power distribution P(l, s) × 1000 is shown in Tables 2, 3, 4, 5 for each of the four cluster models, respectively, in the form of cross table classified by l ("length" in tables) and s ("include" in tables).
1) Usual power
Both tests have the same size 0.043 (distribution of length of significant MLC is omitted) and are shown to have high powers for the hotspot clusters considered here. The flexible spatial scan statistic generally has higher power except for the model A (circular cluster) where, however, the difference is small.
2) Joint powers at (s*, s*) and at its neighbours
Table 2 shows the good characteristics of the circular spatial scan statistic. Namely, the circlebased scan statistic could detect circular hotspot cluster A with length s* = 3 considerably more accurately with power 738/1000 compared to 142/1000 of the flexible spatial scan statistic. Tables 3, 4, 5, on the other hand, show that the power of the circular spatial scan statistic in detecting exactly noncircular hotspot clusters is 0/1000 due to the circular window. However, the circular spatial scan statistic is seen to be able to include some of the hotspot regions into MLC reasonably well. For example, when applied to the noncircular cluster B with length s* = 4, three or four regions including three hotspot regions can be detected as the most likely cluster with relatively high power (523 + 65)/1000 = 0.588 (Table 3). When applied to the model D with length s* = 5, the similar high power 363/1000 can be observed at (l, s) = (6, 4) (Table 5). The flexible spatial scan statistic, on the other hand, has no such high power at a single point (l, s) near (s*, s*). However, the characteristic of the flexible spatial scan statistic is that the support of the power distribution is distributed in a relatively narrow range of / on the line s = s*,i.e, we have s* ≤ l ≤ 12 in the four cluster models considered here.
3) Marginal power P(+, s) and its conditional marginal power P(+, s)/P(+, +)
Regarding the marginal power P(+, s*) at s = s*, the flexible spatial scan statistic is shown to have much higher power than the circular spatial scan statistic for the case of noncircular clusters (Tables 3, 4, 5). Furthermore, the conditional marginal power P(+, s)/P(+, +) of the flexible spatial scan statistic is 964/964 = 1.000, 969/979 = 0.990, 850/890 = 0.955 and 612/673 = 0.909 for the cluster AD, respectively. These results indicate that the identified MLC by the flexible spatial scan statistic includes the hotspot cluster with quite high probability. For the noncircular clusters, the mode of P(+, s) of the circular spatial scan statistic is around s = s*  1 or s = s*  2.
4) Marginal power distribution P(l, +)
For the flexible spatial scan statistic, the probability that the length of significant MLC is less than s = s* is shown to be zero or quite small and the maximum length is around 10 to 12. the circular spatial scan statistic, on the other hand, tends to detect a much longer cluster than expected from the hotspot cluster assumed in the simulation. For example, the probability that the length of MLC for the cluster B with length s* = 4 is greater than or equal to 12 is 213/1000 = 0.213 compared with 5/1000 = 0.005 for the flexible spatial scan statistic. The probability that the length of MLC for the cluster C with length s* = 4 is greater than or equal to 12 is 213/1000 = 0.213 compared with 2/1000 = 0.002 for the flexible spatial scan statistic. This tendency is shown even in the circular cluster A where the same probabilities are 0.035 vs. 0.002.
Cost comparison
Based upon the bivariate power function P(l, s), we can compute the following expected total cost incurred by incomplete identification of the true cluster:
C = C_{2}{rE(s*  S) + E(L  S)}, r = C_{1}/C_{2} (8)
where C_{1} and C_{2} denote the average cost of missing one region in the true cluster and that of incorrectly detecting one region not in the true cluster, respectively. L and S denote the random variable of l and s, respectively. Two expected numbers E(s*  S) and E(L  S) for four kinds of clusters AD are shown in Table 6. In general, we can assume r > 1. For example, the ratio C/C_{2} is shown for the case of r = 1 and r = 2, respectively, in Table 6. However, in this example, irrespective of the value of r(> 1), the circular spatial scan statistic is shown to have lower cost for detecting circular cluster A but to have higher cost for detecting noncircular clusters BD.
Limitations of current work
Needless to say, the results derived here are based upon a small Monte Carlo simulations study and thus the characteristic observed in the current work could change a little bit depending on the cluster model adopted. We assumed here only one hot spot cluster and did not consider the case of several hot spot clusters. Therefore, we need a further simulation study to compare the performance of the two spatial scan statistics under several different clusters.
Regarding the algorithm adopted for the flexible spatial scan statistic, we set the restriction that irregularly shaped windows Z with length k(≤ K) are constructed from members of the (K  1)nearest neighbours to the starting region. It seems that this restriction plays an important role in preventing the flexible spatial scan statistic from reaching out for and absorbing faraway regions with nonelevated risk. However, to avoid undertaking computationally infeasible searches, the flexible spatial scan statistic has to be set with an upperbound for K. This depends on the disease map under study and the capability of the computer. The current practical upperbound is around K = 30 for the reason that the execution time of our current algorithm will take more than a week if K > 30 for the number of regions m = 200 ~ 300. However, it seems to be unlikely that the length of the true cluster would be larger than 10 ~ 15 percent of the total number of regions. So, we think that our current algorithm can be applied to many epidemiological studies with small to moderate cluster sizes. However, for larger cluster sizes, a more sophisticated algorithm to increase the upperbound for K is needed.
Regarding data type, the proposed spatial scan statistic can only be applied to regional count data whereas the circular spatial scan statistic can be applied to not only count data but also individual point data. However, at least in disease surveillance, most of the data that people analyze is aggregated, so the method covers most realworld situations.
Finally, one of the reviewers commented that using small areas as basis for clustering without any attempt to incorporate heterogeneity in background rates is a fundamental flaw of all existing scanning methods. In general, we know that disease risks over study regions are heterogeneous to a certain extent and the null hypothesis of complete spatial randomness is not true. However, statistical hypothesis testing is based upon the null hypothesis which is not true. Likewise, we will use complete spatial randomness as the null hypothesis as indicated in equation (1) since we are interested in rejecting the null hypothesis and detecting the local clusters with excess risk. If we are interested in estimating a clustering mechanism, we should use some modeling approach rather than spatial scan statistics.
Discussion
In this paper, we proposed a flexibly shaped spatial scan statistic to detect arbitrarily shaped clusters by amalgamating administrative units. The flexible spatial scan statistic is, via Monte Carlo simulation, shown to have reasonably high powers compared with the circular spatial scan statistic when examined by a newly introduced bivariate power distribution P(l, s). The simulation reveals that the circular spatial scan statistics shows a high level of accuracy in detecting circular clusters exactly and reasonably good power for including some hotspot regions into the most likely cluster. The flexible spatial scan statistic exhibits no such high power regarding exact identification of clusters but the support of the power distribution is shown to be concentrated in a relatively narrow range of length l on the line s = s*, indicating that an observed significant most likely cluster contains the true cluster with quite high probability. The circular spatial scan statistic, on the other hand, is shown to have zero powers for detecting exactly noncircular clusters that cannot be captured by any circular window. The circular spatial scan statistic is also shown to have a tendency to detect a larger cluster than the true cluster assumed in the simulation even for the case when the true cluster is circular. Furthermore, by introducing the two kinds of cost due to incomplete detection of the true cluster, we could summarize these characteristics in terms of minimizing expected total cost. One of the reviewers suggested a similar cost comparison using the number of people that are incorrectly classified rather than the number of regions since the cost of misclassifying a large region is at least for disease surveillance purposes higher than that of misclassifying a region with smaller population. We think that would be an interesting additional simulation study worth conducting. However, since it can be expected that the result of such a cost comparison strongly depends on the spatial configuration of regions with different population size in the neighborhood of and within the true cluster and thus it requires careful design for creating suitable cluster models from which we can intuitively infer the result to a certain extent, we would like to leave such a simulation study in our future work.
The surprising result that Duczmal and Assunção's scan statistic detected quite large and unlikely peculiar shaped clusters that had the largest likelihood ratio among the three scan statistics might cast a doubt on the validity of the model selection based upon maximizing the likelihood ratio (5). Such a doubt can also be seen in some simulation results of the circular spatial scan statistic that had nonnegligible probabilities of detecting much longer clusters than the true cluster. The flexible spatial scan statistic, on the other hand, is shown not to detect such an unexpected long cluster probably because it has the restriction that our windows are constructed only from members of the (K  1)nearest neighbours to the starting region. Nevertheless, these undesirable properties produced by maximum likelihood ratio might suggest the use of a different criterion for model selection. For example, we might consider a penalized likelihood where we consider a penalty for the complexity of the cluster shape, which is also worth future research.
All the computations and simulations have been conducted on a PC with Windows XP. For users who are interested in applying the flexible spatial scan statistic, we can provide the software FleXScan [20].
Conclusion
The circular spatial scan statistics shows a high level of accuracy in detecting circular clusters exactly and reasonably good power for including some hotspot regions into the most likely cluster. The proposed flexible spatial scan statistic is shown to have good usual powers plus the ability to detect the noncircular hotspot clusters more accurately than the circular spatial scan statistic. However, the proposed spatial scan statistic work well for small to moderate cluster size, say up to 30. For larger cluster sizes, the method is not practically feasible and a more efficient algorithm is needed.
Appendix: algorithm to find the set Z_{2}defined in equation (3)
There are probably several procedures to find the set Z_{2} that is defined as the set of arbitrarily shaped windows Z within a prespecified maximum length K. The algorithm that we used is described as follows:
Step 1. First we set an m × m matrix A = (a_{ ij }) such as
and set Z_{2} = φ and i_{0} = 0
Step 2. Let i_{0} ← i_{0} + 1 and i_{0}(= 1, 2,..., m) be the starting region. Then we create the set consisting of (K  1)nearest neighbours to the starting region i_{0} and i_{0} itself, i.e.,
= {i_{0}, i_{1}, i_{2},..., i_{K  1}},
where i_{ k }is the kth nearest to i_{0}.
Step 3. We consider all the set Z ⊂ , which includes the starting region i_{0}. For any given such set Z, repeat the following steps 4–7.
Step 4. We divide the set Z into two disjoint sets: Z_{0} = {i_{0}} and Z_{1} which contains the other regions of Z.
Step 5. We make two new sets
and . consists of the regions of Z_{1} that are connected to some regions of Z_{0}. On the other hand, consists of the regions of Z_{1} that are not connected to any regions of Z_{0}. Then we replace Z_{0} and Z_{1} by and , respectively.
Step 6. We repeat the step 5 recursively until either Z_{0} or Z_{1} becomes null first.
Step 7. We make a decision as follows. Z is said to be "connected" when Z_{1} becomes null first and "disconnected" when Z_{0} becomes null first. If we can find Z "connected", Z is added to the set Z_{2}. If we find Z "disconnected", Z is discarded.
Step 8. Repeat the steps 2–7 until we finally get the set Z_{2} consisting of arbitrarily shaped windows Z whose maximum length is K.
Now we shall give an example using regions in the Tokyo Metropolitan area shown in Figure 1. Let the starting region i_{0} = 14. Then, the regions in the set of (K  1)nearest neighbours to the region 14 are listed as follows in the ascending order of distance to the region 14, i.e.,
W_{14} = {14, 15, 20, 4, 16, 13, 19, 12, 5,...}.
Suppose that we take a subset Z = {14, 15, 20, 26}. In the first step, we have
Z_{0} = {14}, Z_{1} = {15, 20, 26}.
Since a_{14,15} = a_{14,20} = 1 and a_{14,26} = 0, we then have
Z_{0} = {15, 20}, Z_{1} = {26}.
Further, because a_{15,26} = a_{20,26} = 1, these sets are replaced by
Z_{0} = {26}, Z_{1} = φ.
So, we can find that the set Z = {14, 15, 20, 26} is "connected" and can be a member of Z_{2}.
If we take a subset Z = {14, 15, 20, 5}, we can find Z is "disconnected" because a_{14,5} = a_{15,5} = a_{20,5} = 0, Z_{0} = φ and Z_{1} = {5} at the final stage.
References
 1.
Marshall RJ: A review of the statistical analysis of spatial patterns of disease. Journal of Royal Statistical Society, Series A. 1991, 154: 421441.
 2.
Lawson A, Biggeri A, Böhning D, Lesaffre E, Viel JF, Bertollini R, (Eds): Disease Mapping and Risk Assessment for Public Health. 1999, London: John Wiley & Sons
 3.
Lawson A, Denison D: Spatial Cluster Modelling. 2002, Boca Raton: CRC Press
 4.
Waller LA, Gotway CA: Applied Spatial Statistics for Public Health Data. 2004, New York: John Wiley & Sons
 5.
Cuzick J, Edwards R: Spatial clustering for inhomogeneous populations (with discussion). Journal of the Royal Statistical Society, Series B. 1990, 52: 73104.
 6.
Besag J, Newell J: The detection of clusters in rare diseases. Journal of the Royal Statistical Society, Series A. 1991, 154: 143155.
 7.
Kulldorff M, Nagarwalla N: Spatial disease clusters: detextion and inference. Statistics in Medicine. 1995, 14: 799810.
 8.
Kulldorff M: A spatial scan statistic. Communications in Statistics. 1997, 26: 14811496.
 9.
Tango T: A class of tests for detecting 'general' and 'focused' clustering of rare diseases. Statistics in Medicine. 1995, 14: 23232334.
 10.
Tango T: A test for spatial disease clustering adjusted for multiple testing. Statistics in Medicine. 2000, 19: 191204. 10.1002/(SICI)10970258(20000130)19:2<191::AIDSIM281>3.0.CO;2Q.
 11.
Viel JF, Arveux P, Baverel J, Cahn JY: Softtissue sarcoma and nonHodgkin's lymphoma clusters and a municipal solid waste incinerator with high dioxin emission levels. American Journal of Epidemiology. 2000, 152: 1319. 10.1093/aje/152.1.13.
 12.
Sankoh OA, Ye Y, Sauerborn R, Muller O, Becher H: Clustering of childhood mortality in rural Burkina Faso. International Journal of Epidemiology. 2001, 30: 485492. 10.1093/ije/30.3.485.
 13.
Perez AM, Ward MP, Torres P, Ritacco V: Use of spatial scan statistics and monitoring data to identifyclustering of bovine tuberculosis in Argentina. Preventive Veterinary Medicine. 2002, 56: 6374. 10.1016/S01675877(02)001241.
 14.
Kulldorff M, Tango T, Park PJ: Power comparisons for disease clustering tests. Computational Statistics and Data Analysis. 2003, 42: 665684. 10.1016/S01679473(02)001603.
 15.
Song C, Kulldorff M: Power evaluation of disease clustering tests. International Journal of Health Geographics. 2003, 2 (9): 18.
 16.
Kulldorff M, Information Management Services Inc: SaTScan v4.0: Software for the spatial and spacetime scan statistics. 2004, [http://www.satscan.org/]
 17.
Patil GP, Taillie C: Upper level set scan statistic for detecting arbitrarily shaped hotspots. Environmental and Ecological Statistics. 2004, 11: 183197. 10.1023/B:EEST.0000027208.48919.7e.
 18.
Duczmal L, Assunção R: A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters. Computational Statistics & Data Analysis. 2004, 45: 269286. 10.1016/S01679473(02)00302X.
 19.
Dwass M: Modified randomization test for nonparametric hypotheses. Annals of Mathematical Statistics. 1957, 28: 181187.
 20.
Takahashi K, Yokoyama T, Tango T: FleXScan: Software for the flexible spatial scan statistic. 2004, National Institute of Public Health, Japan
Acknowledgements
This research was supported in part by GrantinAid for Scientific Research (Grant No. 16300091) from the Ministry of Education, Culture, Sports, Science and Technology of Japan.
Author information
Additional information
Authors' contributions
TT proposed the flexibly shaped spatial scan statistic and the bivariate power distribution. KT considered the algorithm given in the appendix, programmed the C++ code and carried out the power simulations. TT wrote the first draft of the manuscript. Both authors interpreted the results and wrote the final version of the paper.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
About this article
Received
Accepted
Published
DOI
Keywords
 True Cluster
 Complete Spatial Randomness
 Tokyo Metropolitan Area
 Circular Window
 Large Cluster Size