A stepwise algorithm for selecting category boundaries for the chi-squared goodness-of-fit test

A stepwise algorithm for selecting categories for the chisquared goodness-of-fit test with completely specified continuous null and alternative distributions is described in this paper. The procedure's starting point is an initial partitioning of the sample space into a large number of categories. A second partition with one fewer category is constructed by combining two categories of the original partition. The procedure continues until there are only two categories; the partition in the sequence with the highest estimated power is the one chosen. For illustartive purposes, the performance of the algorithm is evaluated for several hypothesis tests of the from H₀: normal distribution vs. H₁: a specific mixed normal distribution. For each test considered, the partition identified by the algorithm was compared to several equiprobable partitions, including the equiprobable partition with the highest estimated power. In all cases but one, the algorithm identified a parttion with higher estimated power than the best equiprobable partition. Applciations of the procedure are discussed.