Skip to main content
  • Methodology article
  • Open access
  • Published:

Model-based clustering of DNA methylation array data: a recursive-partitioning algorithm for high-dimensional data arising as a mixture of beta distributions



Epigenetics is the study of heritable changes in gene function that cannot be explained by changes in DNA sequence. One of the most commonly studied epigenetic alterations is cytosine methylation, which is a well recognized mechanism of epigenetic gene silencing and often occurs at tumor suppressor gene loci in human cancer. Arrays are now being used to study DNA methylation at a large number of loci; for example, the Illumina GoldenGate platform assesses DNA methylation at 1505 loci associated with over 800 cancer-related genes. Model-based cluster analysis is often used to identify DNA methylation subgroups in data, but it is unclear how to cluster DNA methylation data from arrays in a scalable and reliable manner.


We propose a novel model-based recursive-partitioning algorithm to navigate clusters in a beta mixture model. We present simulations that show that the method is more reliable than competing nonparametric clustering approaches, and is at least as reliable as conventional mixture model methods. We also show that our proposed method is more computationally efficient than conventional mixture model approaches. We demonstrate our method on the normal tissue samples and show that the clusters are associated with tissue type as well as age.


Our proposed recursively-partitioned mixture model is an effective and computationally efficient method for clustering DNA methylation data.


Epigenetics is the study of heritable changes in gene function that cannot be explained by changes in DNA sequence [1]. One of the most commonly studied epigenetic alterations is cytosine methylation, which occurs in the context of a CpG dinucleotide. Concentrations of CpGs known as CpG islands, when sufficiently methylated, are associated with transcriptional gene silencing tantamount to "one hit" as part of Knudson's two hit hypothesis of tumor suppressor gene inactivation [2]. DNA methylation associated gene silencing is a well recognized epigenetic mechanism that often occurs at tumor suppressor gene loci in human cancer. Hundreds of reports of methylation induced silencing at tumor suppressor genes in virtually all types of human cancer have been published [3, 4].

While there has been a tremendous effort to characterize epigenetic alterations in cancer, surprisingly little work has been done in disease-free tissues. There is a basic need for epigenetic profiling of normal tissues to better understand the contribution of these profiles to tissue specificity, especially in the context of phenotypically important CpGs, where deregulation is associated with human diseases such as cancer. While efforts to characterize the methylation profiles of normal tissues in humans and mice have begun, and certain themes are slowly becoming apparent, relatively few reports have emerged [411]. Most CpGs or CpG regions have been found to have a bimodal distribution of methylation profiles, either hypo- or hypermethylated. Another theme is the disproportionate location of cell or tissue type dependent differentially methylated regions in non-CpG island sites [4, 8]. Furthermore, the Human Epigenome Project showed that the human major histocompatability loci have differential methylation across various human tissues, but that differential methylation does not necessarily lead to differential expression [8]. It is therefore critical to first outline the basal-state of phenotypically important epigenetic marks that are known to contribute to cancer in order to have a background for comparison to other normal and diseased tissues. An approach which characterizes the basal epigenetic state is best suited to foster the discovery of epigenetic profiles that are associated with particular disease states, patient characteristics, exposures or other covariates that may contribute to pathogenesis.

Cluster analysis is often used to identify methylation subgroups in data [12, 13] and, in particular, Siegmund et al. (2004) argue that model-based clustering techniques are often superior to nonparametric approaches [13]. Large-scale methylation arrays are now available for studying methylation genome-wide; the GoldenGate methylation platform from the manufacturer Illumina (San Diego, CA) simultaneously measures cytosine methylation at 1505 phenotypically-important loci associated with over 800 cancer-related genes. The result of the array is a sequence of "beta" values, one for each locus, calculated as the average of approximately 30 replicates (approximately 30 beads per site per sample) of the quantity max(M, 0)/(|U| + |M| + Q), where U is the fluorescent signal from an unmethylated allele on a single bead, M is that from a methylated allele, and Q is a constant chosen to ensure that the quantity is well-defined; an absolute value is used in the denominator of the formula to compensate for negative signals due to background subtraction. Note that each beta value is an approximately continuous variable lying between zero and one, where zero represents an unmethylated locus and one represents a methylated locus. As such, the beta value is appropriately modeled with a beta distribution; we further motivate the choice of beta distribution in the Methods section below. A data set consisting of such sequences produces a high-dimensional data-analysis problem which poses challenges for traditional clustering approaches. In addition, analysis of heterogeneous tissue data can lead to a large number of clusters, as we demonstrate below, which presents further challenges for clustering techniques. For example, nonparametric approaches rely on a choice of metric, which may be difficult to justify in the context of high dimensions and numerous clusters. On the other hand, in model-based clustering, multi-modality of the data likelihood may lead to numerical instability or difficulty in determining the best solution [14].

We propose a novel method for model-based clustering of data of the type produced by Illumina GoldenGate arrays. Our method makes use of a beta mixture model [15]. Although one could use BIC (or similar quantities) to select the number of clusters in the data set, we propose a recursive-partitioning algorithm that provides the number of clusters and a reliable solution in a shorter amount of time than sequential attempts with different numbers of assumed clusters. This is similar in spirit to the idea of recursive partitioning used in Hierarchical Ordered Partitioning and Collapsing Hybrid (HOPACH, [16]), in which clusters are recursively partitioned using a nonparametric algorithm such as PAM [17]. Our method is also an unsupervised variant of Hierarchical Mixtures of Experts [18], a fuzzy version of CART [19]. We also propose a method for reducing the number of loci considered in the analysis, and selecting the optimal number using an "augmented" BIC statistic. We also present a simulation study comparing its properties to those of competitor methods. Finally, we demonstrate the methodology on GoldenGate methylation array data obtained from 217 normal tissue samples.


Throughout the text, we assume a beta mixture model. For subject i, let Y i = (Yi 1, ... Y iJ ) be a vector of J continuous outcomes falling between 0 and 1, and let there be n such vectors. We posit a mixture model having K classes, so that subject i belongs to class C i {1, ..., K} and conditional on class membership, each outcome Y ij is an independent Beta-distributed variable with parameters α kj and β kj depending on both class k and dimension j. The objective of our method is to obtain posterior class membership probabilities w ik = P(C i = k | Y i ). Each class has a profile that is obtained from the collection of parameters α kj and β kj , or equivalently the first two moments:

E ( Y i j | C i = k ) = μ j k = α k j ( α k j + β k j ) 1 and var ( Y i j | C i = k ) = μ j k ( 1 μ j k ) ( α k j + β k j + 1 ) 1 . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeaabiqaaaqaauaabeqabiaaaeaacqWGfbqrcqGGOaakcqWGzbqwdaWgaaWcbaGaemyAaKMaemOAaOgabeaakiabcYha8jabdoeadnaaBaaaleaacqWGPbqAaeqaaOGaeyypa0Jaem4AaSMaeiykaKIaeyypa0JaeqiVd02aaSbaaSqaaiabdQgaQjabdUgaRbqabaGccqGH9aqpcqaHXoqydaWgaaWcbaGaem4AaSMaemOAaOgabeaakiabcIcaOiabeg7aHnaaBaaaleaacqWGRbWAcqWGQbGAaeqaaOGaey4kaSIaeqOSdi2aaSbaaSqaaiabdUgaRjabdQgaQbqabaGccqGGPaqkdaahaaWcbeqaaiabgkHiTiabigdaXaaaaOqaaiabbggaHjabb6gaUjabbsgaKbaaaeaacyGG2bGDcqGGHbqycqGGYbGCcqGGOaakcqWGzbqwdaWgaaWcbaGaemyAaKMaemOAaOgabeaakiabcYha8jabdoeadnaaBaaaleaacqWGPbqAaeqaaOGaeyypa0Jaem4AaSMaeiykaKIaeyypa0JaeqiVd02aaSbaaSqaaiabdQgaQjabdUgaRbqabaGccqGGOaakcqaIXaqmcqGHsislcqaH8oqBdaWgaaWcbaGaemOAaOMaem4AaSgabeaakiabcMcaPiabcIcaOiabeg7aHnaaBaaaleaacqWGRbWAcqWGQbGAaeqaaOGaey4kaSIaeqOSdi2aaSbaaSqaaiabdUgaRjabdQgaQbqabaGccqGHRaWkcqaIXaqmcqGGPaqkdaahaaWcbeqaaiabgkHiTiabigdaXaaakiabc6caUaaaaaa@85AE@


Table 1 displays the classification error and computation time resulting from a simulation study described below in the Methods section. In both cases simulated, the mixture models outperformed the nonparametric methods in terms of classification error. For Case I, based on normal tissue data and described below, our proposed recursive-partitioned mixture model outperformed all other methods, including the standard sequentially-fit mixture models where different values of K are assumed and the results compared via Bayesian Information Criterion (BIC). In addition, two different implementations of our method, each using different BIC criteria for splitting, produced identical results, including classification. For Case II, based on artificial parameters representing extremes of mean and variability, all mixture models performed equally well, and both versions of our proposed method produced the same results. In general, the mixture models had longer computation time than the nonparametric methods (hierarchical clustering and HOPACH); however, we note that the mixture models were implemented as interpreted code in R, while the nonparametric methods were precompiled programs with R interfaces. Note that the recursively-partitioned mixture model was anywhere from 3 to 8 times faster than the sequentially fit mixture model. Table 2 summarizes the number of classes found with hierarchical clustering in combination with dynamic tree cutting, with both versions of HOPACH, and with our proposed method using the standard BIC. For the cases considered, the mixture models almost always found the correct number of classes if J was high enough, while the nonparametric methods often had difficulty finding the correct number of classes. We obtained qualitatively similar results in additional simulations employing different distribution assumptions, though we omit the results.

Table 1 Classification error and computation time for various clustering methods applied to simulated data.
Table 2 Number of classes obtained for various clustering methods applied to simulated data

In the Methods section we propose a variant of BIC to compare model fit for different numbers J of loci. For Case I, the mixture models always minimized the "augmented BIC" at J = 1000, while for Case II, the mixture models always minimized the augmented BIC at J = 25. For Case I, nearly all 1413 dimensions were at least somewhat informative; it is interesting to note that J was always minimized at its highest value for this case. For Case II, the number of informative dimensions was J = 20, so the minimum J was closest to the true number of informative markers among the J considered in this simulation. In additional simulations that used a finer mesh of J, J was minimized at 20. Similar results were obtained when the classes were less balanced (e.g. Case I with class probabilities respectively 0.15, 0.30, 0.2, 0.25, and 0.1).

Normal Tissue

We applied the recursively-partitioned mixture model algorithm to the normal tissue described below in the Methods section. For this analysis, we attempted to split a node only if the weight assigned to the node was greater than 5. The augBIC J statistic, which we propose as a comparative measure of model fit for different numbers J of loci, was minimized at J = 1413, and the algorithm found 23 classes, whose profiles [mean values calculated using (1)] are depicted in Figure 1. All posterior class membership probabilities were indistinguishable from 0 or 1 within numerical error. Table 3 displays the cross-classification between mixture model latent class and tissue sample type. Blood samples were completely separated from other solid tissue samples. In addition, adult blood samples were completely separated from newborn blood samples obtained from Guthrie cards. Placenta samples were also separated from other tissues aside from a single pleura sample. For the most part, head and neck tissue and brain were separated from other samples, but were poorly distinguished between each other. These results were consistent with a Random Forests analysis [20] (8.9% total classification error, additional results not shown), in which we found blood perfectly classified, low classification error for placenta, and some confusion among head and neck tissue and brain tissue.

Table 3 Cross-classification of sample type with latent classes obtained from proposed method
Figure 1
figure 1

Profiles of latent classes among normal tissue samples. Average value (equation 1) depicted by color: yellow = 1.0, black = 0.5, blue = 0.0. Classes are separated by yellow dividing line, with height indicating the relative proportion of subjects within each class. Loci are ordered by their position in a dendrogram obtained via hierarchical clustering.

Using a permutation test with chi-square statistic, the P value for a hypothesis of no association between class and sample type was less than 0.0001. Thus, our proposed method found clusters relevant to sample type. In addition, a permutation test using a Kruskal-Wallis test statistic produced P < 0.0001 for a hypothesis of no difference in mean age among the classes. Interestingly, when the clustering and subsequent hypothesis test was restricted to blood, the P < 0.0001 for a hypothesis of no difference in mean age among latent classes. Between the two classes found among the adult liquid blood samples, age was significantly different (P < 0.0039), consistent with known associations between age and methylation.

Note that the recursion path contains information about relative similarity. For example, in Figure 1, the classes (0...) seem rather distinct from the classes (1...). There is a band of loci that show high methylation in two classes at the top of the figure, indexed as 11101 and 11100, corresponding to brain tissues, but not in the other classes in the left node (1...), mostly corresponding to blood samples; this band also occurs at the bottom of Figure 1, in classes such as 01010, which also include brain tissues. However, as in any hierarchical clustering procedure, the ordering of the children within a node is meaningless, so that classes (11...) and (10...) could have their positions swapped. There is a wider band of loci to the right, which though the distinction may be subtle, appears to drive the distinction between (0...) and (1...). However, because the initial levels of recursion may constitute only a crude splitting of the data, the tree representing the recursion path likely has greater meaning only at lower levels of recursion.

We also analyzed the normal tissue methylation data using HOPACH. The greedy version of the algorithm produced only 4 classes. The "best" version produced 9 clusters, which are cross-classified with tissue type in Table 4 and with the latent classes obtained from our proposed method in Table 5. As Table 5 shows, the classes found by our proposed method were, for the most part, subsets of the 9 classes found using HOPACH, with a few exceptions that involve minor disagreements in classification. While the apparent compactness of the HOPACH classification seems, at first glance, more attractive than the classification produced by our model-based method, we remark that is has a few subtle problems. It has three singletons, clusters 6, 8, and 9, which could be grouped together with cluster 7 to comprise a class that entirely represents placental tissue. While a similar criticism could be made of our proposed method with respect to classification of blood, some of the classes have verifiable meaning; for example, the classes indexed 1100 and 1101 distinguish age among blood samples taken from adults. HOPACH classification also associates one head and neck tissue sample with blood, and two cervical samples with numerous other tissues in the 5th class. The 5th class associates numerous tissue types, and comprises 6 different classes produced by our proposed method. Table 6 shows the cross-classification of tissue type with these 6 classes for the subjects comprising the 5th HOPACH class. The classification correctly isolates two of three cervix samples, and has a tendency to distinguish pleura from lung samples. Using a permutation test with chi-square statistic, the P value for a hypothesis of no association between class and sample type among the 6 classes from our model-based method was less than 0.0001, demonstrating that the classes produced by the mixture model have additional information with respect to tissue type. In order to compare the predictive ability of the two classification schemes overall, we applied the Random Forest algorithm to indicator variables representing HOPACH clusters (using all 9 variables for every bootstrap) and to indicator variables representing our model-based classification (using all 23 variables for every bootstrap). In the former case we obtained a misclassification rate of 18.43%, and in the latter case a misclassification rate of 17.97%, the difference being the misclassification of one less sample using the model-based method. Employing the Random Forest algorithm in a similar manner to predict age, we obtained a mean-squared-residual of 190.1 for HOPACH and 164.8 for the model-based classification, with variance explained equal to 80.6% and 83.2% respectively. Thus, the model-based classification seems to offer modest improvements over HOPACH in ability to make biological distinctions.

Table 4 Cross-classification of sample type with clusters obtained from HOPACH
Table 5 Cross-classification of latent classes obtained from proposed method with clusters obtained from HOPACH
Table 6 Cross-classification of sample type with latent classes obtained from proposed method among subjects within the 5th class obtained by HOPACH


Our proposed method is a model-based version of the HOPACH algorithm [16]: we recursively use a beta-mixture model [15] to propose a split of an existing cluster, preserving the split only when it is judged on the basis of BIC to better fit the data. We have found that the integrated-classification-likelihood BIC (ICL-BIC) [15] and BIC produce practically identical results; this result is not unexpected, since the two differ only in a term involving entropy and a perfect classification results in zero entropy. A high-dimensional data set will tend to result in approximately perfect classification of most subjects, even though each subject has the opportunity to be portioned out over multiple clusters (a distinction between our method and nonparametric methods such as HOPACH). Consequently, in the deeper levels of recursion, the algorithm will not depend on the distinction between BIC and ICL-BIC. For the earlier recursion stages, we assume that there is a strong preference for splitting, which overcomes the entropy penalty in the ICL-BIC.

Siegmund et al. (2004) argue that model-based clustering is preferred in this context over hierarchical clustering [13], a finding that bears out in our simulations. One reason for the superior performance, at least in a high-dimensional context, is that the metric used to characterize the differences in nonparametric contexts may be relatively insensitive to differences in particular dimensions. This may play a role in the apparent differences in classification of normal tissue between our proposed method and HOPACH.

K-means have been used recently to cluster methylation outcomes [12], though the work of van der Laan and Pollard (2003) seems to suggest that HOPACH may yield results that are superior to K-means. In particular, with K-means it is difficult to know how many classes are inherent in the data without resampling-based methods such as the gap statistic [21], with implications for scalability. Also, the "curse of dimensionality" would tend to degrade the performance of procedures such as K-means when there are a large number of clusters and the observed data is of high dimension. In general, nonparametric methods such as the fanny algorithm [17] rely on tuning parameters that are difficult to optimize without resampling. An additional problem with non-parametric procedures is that they typically consider only the first moment (mean) of the underlying distributions, ignoring the second-moment (variance) which for DNA methylation as measured by the GoldenGate assay, may play a critical role in distinguishing tissues.

We propose a dimension-reduction strategy which simply ranks candidate dimensions on the basis of some criterion such as variance, fits the top J dimensions in a mixture model, and employs an augmented version of BIC to compare model fit across different values of J. This is a departure from the penalized-likelihood methods of the kind described in [22], which would become computationally difficult for truly high-dimensional data. Our approach is similar in spirit to supervised principal components methods such as [23]. Interestingly, for the normal tissue data, all 1413 loci were found to be informative. The implication is that methylation at even the least variable locus, COL6A1_P283_F (a locus on chromosome 21 within a gene that encodes the extracellular matrix component collagen VI), contains information about tissue type. In fact, box-plots showing the distribution of COL6A1_P283_F methylation demonstrate great heterogeneity in apparent distribution by tissue type [see Additional file 1], even though all methylation average beta values were less than 0.05. The Kruskal-Wallis P value for testing the association of COL6A1_P283_F methylation with tissue type was P < 0.0001. While this difference could be a subtle artifact of plate-to-plate variability and heterogeneity in plate sample composition, it also may be that the average beta measured by the GoldenGate assay is in fact an average of methylation status over different cell types: that is, tissue samples may consist of cells having heterogeneous methylation states, with each tissue type having a unique mixture. A separate paper describing analysis of normal tissue in detail is under preparation.

We remark that we did not normalize the different plates used in laboratory analysis, for reasons described below. However, when we used the analytical methods of this paper to classify methylation profiles within plate strata and within tissue type strata, we found much greater variability between tissue types than between plates (results not shown). Our results are consistent with expectations developed from an understanding of the current literature on DNA methylation in normal tissues, though we cannot entirely rule out subtle biases introduced by variation between plates. It may be possible to incorporate plate effects in our proposed methodology by modeling the mean response (e.g., see [22]), but the computational considerations are beyond the scope of the present paper.


In summary, our method appears to have good properties both with respect to classification error and computation time. It achieves these properties by combining the strengths of model-based and hierarchical methods, navigating the underlying clusters quickly through recursive partitioning, but doing so in a way that makes use of a reasonable probability model. This model is also used to compare different dimensions J of input, thus refining the discriminative ability in a scalable manner.


Normal Tissue Data

Our proposed method is motivated by methylation array data obtained for normal tissue. We extracted DNA from 217 normal tissue samples, modified with sodium bisulfite, and processed them on the Illumina GoldenGate methylation platform. Tissues were assembled by a collaborative, multi-institutional network of principal investigators conducting molecular epidemiologic studies of human cancer. Participating institutions include the International Mesothelioma Program at Brigham and Women's Hospital, Brown University, Dartmouth-Hitchcock Medical Center, University of California – San Francisco, Brain Tumor SPORE program, University of Massachusetts – Lowell, and the University of Minnesota. Tissues were obtained through Institutional Review Board approved studies already underway at these institutions, or purchased from the National Disease Research Interchange (NDRI). A variety of normal tissue types were assembled: bladder (n = 5), blood (n = 85), brain (n = 12), cervix (n = 3), head and neck (n = 11), kidney (n = 6), lung (n = 53), placenta (n = 19), pleura (n = 18), and small intestine (n = 5). All tissue samples were from adults except n = 55 samples of Guthrie card derived blood samples from newborns. Figure 2 illustrates the methylation pattern for all 217 subjects and 1413 loci passing quality-assurance procedures (median detection P-value < 0.05).

Figure 2
figure 2

Unadjusted Average Beta values obtained from Illumina GoldenGate methylation platform for 1413 tumor suppressor loci on 217 normal tissue samples. Yellow = 1.0, black = 0.5, blue = 0.0. Autosomal chromosomes are grouped to aid visualization. For each chromosome group, loci are ordered by their position in a dendrogram produced by hierarchical clustering. Similarly, within tissue sample groups, samples are ordered by their position in a hierarchical clustering dendrogram.

These data are part of a larger project comparing normal tissue to tumors for many different types of tumor (e.g. bladder, brain, leukemia, lung, mesothelioma, etc.); each of these comparisons constitutes a distinct set of analyses deserving of a separate, focused analysis, so we omit the details from the present manuscript. In addition, a more comprehensive analysis of normal tissue will appear in a separate manuscript targeted to biologists. Within logistical constraints (e.g. availability of normal tissue, which is difficult to obtain for some tissue types, and time and budget constraints) we randomized tissue type to 14 plates (96 wells each). However, because of the great number of different tissue types, the difficulty in collecting normal tissue of specific types (recall that methylation profiles differ profoundly by tissue type), and heterogeneity of both normal and tumor samples, we expect the plate-to-plate heterogeneity to be dominated the heterogeneity of sample type on each plate. When we used the methods of this paper to classify methylation profiles, stratifying first by plate and examining associations with sample type, then stratifying by distinct tissue-type and examining associations with plate, we found that there are unequivocal differences between sample type on a single plate, and generally no differences between plate within a given sample type, with the possible exception of placenta, whose methylation values have greater variability and therefore may have more sensitivity to random heterogeneity with small sample size. On the other hand, attempts to normalize plates using standard techniques may result in overcorrection, since plate-to-plate variability is mostly driven by sample heterogeneity, and corrections will tend to average out the distinctions of interest.

Note that in addition to providing average "beta" values, the GoldenGate platform also provides averages M ¯ MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmyta0Kbaebaaaa@2D10@ and U ¯ MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmyvauLbaebaaaa@2D20@ (average fluorescence for methylated and unmethylated alleles). For our data, the quantities M ¯ / ( U ¯ + M ¯ ) MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmyta0KbaebacqGGVaWlcqGGOaakcuWGvbqvgaqeaiabgUcaRiqbd2eanzaaraGaeiykaKcaaa@3310@ were close to the reported average "beta" values, with the standard deviation of the difference between the two less than 0.01, a fact which has implications below.

Recursive-partitioning for a Beta Mixture Model

Under the assumption that M ¯ MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmyta0Kbaebaaaa@2D10@ and U ¯ MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmyvauLbaebaaaa@2D20@ approximately follow gamma distributions on the same scale, the quantity M ¯ / ( U ¯ + M ¯ ) MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmyta0KbaebacqGGVaWlcqGGOaakcuWGvbqvgaqeaiabgUcaRiqbd2eanzaaraGaeiykaKcaaa@3310@ , which is close to the reported average "beta" value, follows a beta distribution. In addition, the mean of correlated Bernoulli variables can be modeled by (1), with an appropriate re-parameterization of scale parameters [24]; there is consequently a biological motivation for using a beta distribution. For each single subject i, we assume class membership C i {1, ..., K}. For methylation data Y ij at locus j from subject i, we assume the distribution

f ( Y i j = y | C i = k ) = B ( α k j , β k j ) 1 y α k j 1 ( 1 y ) β k j 1 , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaemOzayMaeiikaGIaemywaK1aaSbaaSqaaiabdMgaPjabdQgaQbqabaGccqGH9aqpcqWG5bqEcqGG8baFcqWGdbWqdaWgaaWcbaGaemyAaKgabeaakiabg2da9iabdUgaRjabcMcaPiabg2da9iabckeacjabcIcaOiabeg7aHnaaBaaaleaacqWGRbWAcqWGQbGAaeqaaOGaeiilaWIaeqOSdi2aaSbaaSqaaiabdUgaRjabdQgaQbqabaGccqGGPaqkdaahaaWcbeqaaiabgkHiTiabigdaXaaakiabdMha5naaCaaaleqabaGaeqySde2aaSbaaWqaaiabdUgaRjabdQgaQbqabaWccqGHsislcqaIXaqmaaGccqGGOaakcqaIXaqmcqGHsislcqWG5bqEcqGGPaqkdaahaaWcbeqaaiabek7aInaaBaaameaacqWGRbWAcqWGQbGAaeqaaSGaeyOeI0IaeGymaedaaOGaeiilaWcaaa@60EA@

which depends on both class k and locus j through the parameters α kj and β kj . Under the assumption that C i = k with probability η k , k = 1 K η k = 1 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaWaaabmaeaacqaH3oaAdaWgaaWcbaGaem4AaSgabeaaaeaacqWGRbWAcqGH9aqpcqaIXaqmaeaacqWGlbWsa0GaeyyeIuoakiabg2da9iabigdaXaaa@3777@ , and that methylation at each locus is independent conditional on class membership, the likelihood contribution from subject i is

f ( Y i = y i ) = k = 1 K η k j = 1 J B ( α k j , β k j ) 1 y i j α k j 1 ( 1 y i j ) β k j 1 . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaemOzayMaeiikaGIaeCywaK1aaSbaaSqaaiabdMgaPbqabaGccqGH9aqpcqWH5bqEdaWgaaWcbaGaemyAaKgabeaakiabcMcaPiabg2da9maaqadabaGaeq4TdG2aaSbaaSqaaiabdUgaRbqabaGcdaqeWaqaaiabckeacjabcIcaOiabeg7aHnaaBaaaleaacqWGRbWAcqWGQbGAaeqaaOGaeiilaWIaeqOSdi2aaSbaaSqaaiabdUgaRjabdQgaQbqabaGccqGGPaqkdaahaaWcbeqaaiabgkHiTiabigdaXaaakiabdMha5naaDaaaleaacqWGPbqAcqWGQbGAaeaacqaHXoqydaWgaaadbaGaem4AaSMaemOAaOgabeaaliabgkHiTiabigdaXaaakiabcIcaOiabigdaXiabgkHiTiabdMha5naaBaaaleaacqWGPbqAcqWGQbGAaeqaaOGaeiykaKYaaWbaaSqabeaacqaHYoGydaWgaaadbaGaem4AaSMaemOAaOgabeaaliabgkHiTiabigdaXaaaaeaacqWGQbGAcqGH9aqpcqaIXaqmaeaacqWGkbGsa0Gaey4dIunaaSqaaiabdUgaRjabg2da9iabigdaXaqaaiabdUealbqdcqGHris5aOGaeiOla4caaa@7058@

With observed data D = {y1, ..., y n }, we then maximize the full-data log-likelihood,

( α , β , η ) = i = 1 n log { f ( Y i = y i ) } , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeS4eHWMaeiikaGcccmGae8xSdeMaeiilaWIae8NSdiMaeiilaWIae83TdGMaeiykaKIaeyypa0ZaaabmaeaacyGGSbaBcqGGVbWBcqGGNbWzcqGG7bWEcqWGMbGzcqGGOaakcqWHzbqwdaWgaaWcbaGaemyAaKgabeaakiabg2da9iabhMha5naaBaaaleaacqWGPbqAaeqaaOGaeiykaKIaeiyFa0haleaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGUbGBa0GaeyyeIuoakiabcYcaSaaa@4F63@

with respect to the set of all parameters (α, β, η) to be estimated:

α = (α11, ..., α1J, α21, ..., α KJ ), β = (β11, ..., β1J, β21, ..., β KJ ), and η = (η1, ..., ηK-1). This is easily achieved using an Expectation-Maximization (EM) algorithm [25]. Briefly, we initialize the procedure with an n × K matrix of weights W = (w ik ) whose rows sum to one. The rows represent initial guesses at class membership probabilities for each subject. For each k, we set η k = n 1 i = 1 n w i k MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeq4TdG2aaSbaaSqaaiabdUgaRbqabaGccqGH9aqpcqWGUbGBdaahaaWcbeqaaiabgkHiTiabigdaXaaakmaaqadabaGaem4DaC3aaSbaaSqaaiabdMgaPjabdUgaRbqabaaabaGaemyAaKMaeyypa0JaeGymaedabaGaemOBa4ganiabggHiLdaaaa@3E9F@ and maximize the quantity

k ( w ) = i = 1 n w i k log { f ( Y i = y i | C i = k ) } = Q k + i = 1 n w i k j = 1 J [ α k j log ( y i j ) + β k j log ( 1 y i j ) log { B ( α k j , β k j ) ] } ] , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeWabiqaaaqaaiabloriSnaaDaaaleaacqWGRbWAaeaacqGGOaakcqWG3bWDcqGGPaqkaaGccqGH9aqpdaaeWaqaaiabdEha3naaBaaaleaacqWGPbqAcqWGRbWAaeqaaOGagiiBaWMaei4Ba8Maei4zaCMaei4EaSNaemOzayMaeiikaGIaeCywaK1aaSbaaSqaaiabdMgaPbqabaGccqGH9aqpcqWH5bqEdaWgaaWcbaGaemyAaKgabeaakiabcYha8jabdoeadnaaBaaaleaacqWGPbqAaeqaaOGaeyypa0Jaem4AaSMaeiykaKIaeiyFa0haleaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGUbGBa0GaeyyeIuoaaOqaaiabg2da9iabdgfarnaaBaaaleaacqWGRbWAaeqaaOGaey4kaSYaaabmaeaacqWG3bWDdaWgaaWcbaGaemyAaKMaem4AaSgabeaakmaaqadabaWaamWaaeaacqaHXoqydaWgaaWcbaGaem4AaSMaemOAaOgabeaakiGbcYgaSjabc+gaVjabcEgaNjabcIcaOiabdMha5naaBaaaleaacqWGPbqAcqWGQbGAaeqaaOGaeiykaKIaey4kaSIaeqOSdi2aaSbaaSqaaiabdUgaRjabdQgaQbqabaGccyGGSbaBcqGGVbWBcqGGNbWzcqGGOaakcqaIXaqmcqGHsislcqWG5bqEdaWgaaWcbaGaemyAaKMaemOAaOgabeaakiabcMcaPiabgkHiTiGbcYgaSjabc+gaVjabcEgaNjabcUha7jabckeacjabcIcaOiabeg7aHnaaBaaaleaacqWGRbWAcqWGQbGAaeqaaOGaeiilaWIaeqOSdi2aaSbaaSqaaiabdUgaRjabdQgaQbqabaGccqGGPaqkcqGGDbqxcqGG9bqFaiaawUfacaGLDbaacqGGSaalaSqaaiabdQgaQjabg2da9iabigdaXaqaaiabdQeakbqdcqGHris5aaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaemOBa4ganiabggHiLdaaaaaa@A550@

where Q k is constant with respect to parameters, to obtain the α and β parameters corresponding to class k. Reversing the order of summation in (3) shows that each dimension j can be maximized separately. We subsequently update the weights as follows:

w i k = η k j = 1 J B ( α k j , β k j ) 1 y i j α k j 1 ( 1 y i j ) β k j 1 k = 1 K η k j = 1 J B ( α k j , β k j ) 1 y i j α k j 1 ( 1 y i j ) β k j 1 , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaem4DaC3aaSbaaSqaaiabdMgaPjabdUgaRbqabaGccqGH9aqpjuaGdaWcaaqaaiabeE7aOnaaBaaabaGaem4AaSgabeaadaqeWaqaaiabckeacjabcIcaOiabeg7aHnaaBaaabaGaem4AaSMaemOAaOgabeaacqGGSaalcqaHYoGydaWgaaqaaiabdUgaRjabdQgaQbqabaGaeiykaKYaaWbaaeqabaGaeyOeI0IaeGymaedaaiabdMha5naaDaaabaGaemyAaKMaemOAaOgabaGaeqySde2aaSbaaeaacqWGRbWAcqWGQbGAaeqaaiabgkHiTiabigdaXaaacqGGOaakcqaIXaqmcqGHsislcqWG5bqEdaWgaaqaaiabdMgaPjabdQgaQbqabaGaeiykaKYaaWbaaeqabaGaeqOSdi2aaSbaaeaacqWGRbWAcqWGQbGAaeqaaiabgkHiTiabigdaXaaaaeaacqWGQbGAcqGH9aqpcqaIXaqmaeaacqWGkbGsaiabg+GivdaabaWaaabmaeaacqaH3oaAdaWgaaqaaiabdUgaRbqabaWaaebmaeaacqGGcbGqcqGGOaakcqaHXoqydaWgaaqaaiabdUgaRjabdQgaQbqabaGaeiilaWIaeqOSdi2aaSbaaeaacqWGRbWAcqWGQbGAaeqaaiabcMcaPmaaCaaabeqaaiabgkHiTiabigdaXaaacqWG5bqEdaqhaaqaaiabdMgaPjabdQgaQbqaaiabeg7aHnaaBaaabaGaem4AaSMaemOAaOgabeaacqGHsislcqaIXaqmaaGaeiikaGIaeGymaeJaeyOeI0IaemyEaK3aaSbaaeaacqWGPbqAcqWGQbGAaeqaaiabcMcaPmaaCaaabeqaaiabek7aInaaBaaabaGaem4AaSMaemOAaOgabeaacqGHsislcqaIXaqmaaaabaGaemOAaOMaeyypa0JaeGymaedabaGaemOsaOeacqGHpis1aaqaaiabdUgaRjabg2da9iabigdaXaqaaiabdUealbGaeyyeIuoaaaGccqGGSaalaaa@9BAA@

iterating until ℓ(α, β, η) does not change. The final weight w ik represents the posterior probability that subject i belongs to class k, i.e. w ik = P(C i = k|Y1, ..., Y n ). As for most finite-mixture methods, we might decide on the number of classes K by fitting mixture models for a range of possible values of K, computing the BIC statistic

B I C = log ( n ) ( 2 J K + K 1 ) 2 i = 1 n log { f ( Y i = y ) } MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeiOqaiKaeiysaKKaei4qamKaeyypa0JagiiBaWMaei4Ba8Maei4zaCMaeiikaGIaemOBa4MaeiykaKIaeiikaGIaeGOmaiJaemOsaOKaem4saSKaey4kaSIaem4saSKaeyOeI0IaeGymaeJaeiykaKIaeyOeI0IaeGOmaiZaaabmaeaacyGGSbaBcqGGVbWBcqGGNbWzcqGG7bWEcqWGMbGzcqGGOaakcqWHzbqwdaWgaaWcbaGaemyAaKgabeaakiabg2da9iabhMha5jabcMcaPiabc2ha9bWcbaGaemyAaKMaeyypa0JaeGymaedabaGaemOBa4ganiabggHiLdaaaa@5861@

and selecting the value of K corresponding to the minimum BIC. In the context of beta mixture models, a modified version of BIC is available [15]: the ICL-BIC is defined as the sum of (4) and the entropy term 2 i = 1 n k = 1 K w i k log ( w i k ) MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeyOeI0IaeGOmaiZaaabmaeaadaaeWaqaaiabdEha3naaBaaaleaacqWGPbqAcqWGRbWAaeqaaOGagiiBaWMaei4Ba8Maei4zaCMaeiikaGIaem4DaC3aaSbaaSqaaiabdMgaPjabdUgaRbqabaGccqGGPaqkaSqaaiabdUgaRjabg2da9iabigdaXaqaaiabdUealbqdcqGHris5aaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaemOBa4ganiabggHiLdaaaa@4980@ (where 0 log (0) = 0). The entire operation has approximate complexity n J K max 2 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaemOBa4MaemOsaOKaem4saS0aa0baaSqaaiGbc2gaTjabcggaHjabcIha4bqaaiabikdaYaaaaaa@34BB@ , where Kmax is the maximum number of classes attempted. The square term arises under the assumption that for a single model with K classes, the complexity will be of order nJK.

Because likelihoods for model-based clustering algorithms can be multi-modal [14, 26], commercial mixture model software packages often use multiple starting values for fitting the model, and subsequently choose the estimates corresponding to the maximum likelihood. However, careful choice of starting values can often minimize the effort [22, 26]. One option is to use hierarchical clustering to find K clusters (cutting the clustering dendrogram at the appropriate height), and constructing a weight matrix W corresponding to these clusters. Another, similar, option is to use a fuzzy clustering algorithm such as the fanny algorithm [17] available in the R package cluster.

We now propose a recursive method that, on average, has complexity nJK log(K), where K is the true number of classes. Consider the following weighted-likelihood version of (2),

( ω ) ( α , β , η ; ω ) = i = 1 n ω i log { f ( Y i = y i ) } . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeS4eHW2aaWbaaSqabeaacqGGOaakcqaHjpWDcqGGPaqkaaGccqGGOaakiiWacqWFXoqycqGGSaalcqWFYoGycqGGSaalcqWF3oaAcqGG7aWocqWFjpWDcqGGPaqkcqGH9aqpdaaeWaqaaiabeM8a3naaBaaaleaacqWGPbqAaeqaaOGagiiBaWMaei4Ba8Maei4zaCMaei4EaSNaemOzayMaeiikaGIaeCywaK1aaSbaaSqaaiabdMgaPbqabaGccqGH9aqpcqWH5bqEdaWgaaWcbaGaemyAaKgabeaakiabcMcaPiabc2ha9bWcbaGaemyAaKMaeyypa0JaeGymaedabaGaemOBa4ganiabggHiLdGccqGGUaGlaaa@5941@

When ω i ≡ 1 for all i, (2) and (5) are equivalent. When 0 <ω i < 1, subject i only partially contributes to estimation, and when ω i = 0, subject i is excluded entirely from consideration in the model. The EM algorithm described above is easily modified by multiplying each w ik by ω i in (3), where the interpretation is that the classes under consideration are only a partial set, and that subject i belongs to one of these classes only with probability ω i . If we begin by fitting a 2-class model to the entire data set, the result is two sets of posterior weights representing the posterior probabilities of membership in each of the two classes. Under the assumption that each of these classes can be further split, and that each subject belongs to the subsequent splits only with probability equal to the weight assigned to the un-split class, we apply the weighted-likelihood EM algorithm to obtain the two classes corresponding to the new split.

To make this idea more precise, define a concatenation operation τ on a sequence of binary values r = (q1, ..., q T ), as τ(r, q) = (q1, ..., q T , q). This provides a natural notation for recursive binary partitioning, where longer sequences represent deeper levels of recursion. The first two-class model, initialized by nonparametric cluster analysis, results in two sets of weights, ω i ( 0 ) = w i 1 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeqyYdC3aa0baaSqaaiabdMgaPbqaaiabcIcaOiabicdaWiabcMcaPaaakiabg2da9iabdEha3naaBaaaleaacqWGPbqAcqaIXaqmaeqaaaaa@36C8@ and ω i ( 1 ) = w i 2 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeqyYdC3aa0baaSqaaiabdMgaPbqaaiabcIcaOiabigdaXiabcMcaPaaakiabg2da9iabdEha3naaBaaaleaacqWGPbqAcqaIYaGmaeqaaaaa@36CC@ . For any sequence r, a mixture model can be attempted using the weighted EM algorithm with weights ω i ( r ) MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeqyYdC3aa0baaSqaaiabdMgaPbqaaiabcIcaOiabdkhaYjabcMcaPaaaaaa@3249@ . If the EM algorithm fails, then we terminate the recursion at that point, but if the EM algorithm succeeds, we can set new weights ω i ( τ ( r , 0 ) ) = ω i ( r ) w i 1 ( r ) MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeqyYdC3aa0baaSqaaiabdMgaPbqaaiabcIcaOiabes8a0jabcIcaOiabdkhaYjabcYcaSiabicdaWiabcMcaPiabcMcaPaaakiabg2da9iabeM8a3naaDaaaleaacqWGPbqAaeaacqGGOaakcqWGYbGCcqGGPaqkaaGccqWG3bWDdaqhaaWcbaGaemyAaKMaeGymaedabaGaeiikaGIaemOCaiNaeiykaKcaaaaa@462A@ , ω i ( τ ( r , 1 ) ) = ω i ( r ) w i 2 ( r ) MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeqyYdC3aa0baaSqaaiabdMgaPbqaaiabcIcaOiabes8a0jabcIcaOiabdkhaYjabcYcaSiabigdaXiabcMcaPiabcMcaPaaakiabg2da9iabeM8a3naaDaaaleaacqWGPbqAaeaacqGGOaakcqWGYbGCcqGGPaqkaaGccqWG3bWDdaqhaaWcbaGaemyAaKMaeGOmaidabaGaeiikaGIaemOCaiNaeiykaKcaaaaa@462E@ , and continue the recursion. Note that at each level of recursion, the weights become smaller; since a mixture model becomes unstable with small weights (corresponding to small numbers of pseudo-subjects), the recursion ultimately terminates completely at a set of leaf nodes corresponding to un-split classes. We can stabilize this process by terminating the recursion if the sum of the weights is less than some pre-specified value (e.g. 5). We can also terminate early if the split leads to a less parsimonious representation of the data. To this end, we propose the following weighted versions of BIC:

w t d B I C 2 ( r ) = ( 4 J + 1 ) log ( i = 1 n ω i r ) 2 ( ω ) ( α ( r ) , β ( r ) , η ( r ) ; ω ( r ) ) , w t d B I C 1 ( r ) = 2 J log ( i = 1 n ω i r ) 2 ( ω ) ( α ( r ) , β ( r ) , η ( r ) ; ω ( r ) ) , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeaabiqaaaqaaiabcEha3jabcsha0jabcsgaKjabckeacjabcMeajjabcoeadnaaBaaaleaacqaIYaGmaeqaaOGaeiikaGIaemOCaiNaeiykaKIaeyypa0JaeiikaGIaeGinaqJaemOsaOKaey4kaSIaeGymaeJaeiykaKIagiiBaWMaei4Ba8Maei4zaC2aaeWaaeaadaaeWaqaaiabeM8a3naaDaaaleaacqWGPbqAaeaacqWGYbGCaaaabaGaemyAaKMaeyypa0JaeGymaedabaGaemOBa4ganiabggHiLdaakiaawIcacaGLPaaacqGHsislcqaIYaGmcqWItecBdaahaaWcbeqaaiabcIcaOiabeM8a3jabcMcaPaaakiabcIcaOGGadiab=f7aHnaaCaaaleqabaGaeiikaGIaemOCaiNaeiykaKcaaOGaeiilaWIae8NSdi2aaWbaaSqabeaacqGGOaakcqWGYbGCcqGGPaqkaaGccqGGSaalcqWF3oaAdaahaaWcbeqaaiabcIcaOiabdkhaYjabcMcaPaaakiabcUda7iab=L8a3naaCaaaleqabaGaeiikaGIaemOCaiNaeiykaKcaaOGaeiykaKIaeiilaWcabaGaei4DaCNaeiiDaqNaeiizaqMaeiOqaiKaeiysaKKaei4qam0aaSbaaSqaaiabigdaXaqabaGccqGGOaakcqWGYbGCcqGGPaqkcqGH9aqpcqaIYaGmcqWGkbGscyGGSbaBcqGGVbWBcqGGNbWzdaqadaqaamaaqadabaGaeqyYdC3aa0baaSqaaiabdMgaPbqaaiabdkhaYbaaaeaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGUbGBa0GaeyyeIuoaaOGaayjkaiaawMcaaiabgkHiTiabikdaYiabloriSnaaCaaaleqabaGaeiikaGIaeqyYdCNaeiykaKcaaOGaeiikaGIae8xSde2aaWbaaSqabeaacqGHxiIkcqGGOaakcqWGYbGCcqGGPaqkaaGccqGGSaalcqWFYoGydaahaaWcbeqaaiabgEHiQiabcIcaOiabdkhaYjabcMcaPaaakiabcYcaSiab=D7aOnaaCaaaleqabaGaey4fIOIaeiikaGIaemOCaiNaeiykaKcaaOGaei4oaSJae8xYdC3aaWbaaSqabeaacqGHxiIkcqGGOaakcqWGYbGCcqGGPaqkaaGccqGGPaqkcqGGSaalaaaaaa@B370@

where the first set of parameters, defining wtdBIC2, are obtained from the two-class mixture model and the second set of parameters, defining wtdBIC1, are obtained from a one-class model. Alternatively, one may add an entropy term to wtdBIC2(r) to produce the ICL version of this BIC value; note that for a one-class model, entropy is always zero. If wtdBIC2(r) is greater than wtdBIC1(r), we terminate the recursion at node r. The worst-case complexity of this algorithm is n log(n)J. However, at deeper levels of recursion, two-class models will tend to fit poorly relative to single-class models, and most nodes will terminate before descending to the deepest levels. We have demonstrated empirically that the proposed method tends to terminate with the number of leaf classes equal to the true number of classes, so that the average complexity is typically of approximate order nJK log(K). Furthermore, in the deeper classes, subjects whose weights are negligible can be dropped entirely from the weighted EM algorithm, so that the complexity of the node-level fit at deeper levels is much less than n.

Dimension reduction

Non-informative loci may lead to excessive noise in the solution. Regularization methods may be used to constrain the degrees-of-freedom, leading to more precise solutions [22, 27]. However, in extremely high dimensions, it can also lead to increased computation time and curtail scalability. We propose an alternative, where all L starting loci are ordered with respect to variance, and the J most variable loci are selected for inclusion in the recursive algorithm described above. A final BIC value can be obtained using (4) by considering all leaf-level un-split classes as distinct clusters, with class prevalence parameter vector η obtained by summing the final weights ω i ( r ) MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeqyYdC3aa0baaSqaaiabdMgaPbqaaiabcIcaOiabdkhaYjabcMcaPaaaaaa@3249@ and dividing by n. However, this BIC is not comparable across different values of J. Note that the exclusion of L - J loci is equivalent to the assumption that all K classes have identical distributions for the excluded loci. Thus, beta distributions can be fit to each excluded locus using maximum-likelihood, and the resulting parameter estimates included in a final BIC statistic. Specifically, the likelihood for the full data Y i = ( Y i 1 , ... Y i J , Y i ( J + 1 ) , ... , Y i L ) = ( Y i , Y ˜ i ) MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeCywaK1aa0baaSqaaiabdMgaPbqaaiabgEHiQaaakiabg2da9iabcIcaOiabdMfaznaaBaaaleaacqWGPbqAcqaIXaqmaeqaaOGaeiilaWIaeiOla4IaeiOla4IaeiOla4IaemywaK1aaSbaaSqaaiabdMgaPjabdQeakbqabaGccqGGSaalcqWGzbqwdaWgaaWcbaGaemyAaKMaeiikaGIaemOsaOKaey4kaSIaeGymaeJaeiykaKcabeaakiabcYcaSiabc6caUiabc6caUiabc6caUiabcYcaSiabdMfaznaaBaaaleaacqWGPbqAcqWGmbataeqaaOGaeiykaKIaeyypa0JaeiikaGIaeCywaK1aaSbaaSqaaiabdMgaPbqabaGccqGGSaalcuWHzbqwgaacamaaBaaaleaacqWGPbqAaeqaaOGaeiykaKcaaa@576B@ , where we assume the dimensions have been ordered by descending variance and Y ˜ i MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafCywaKLbaGaadaWgaaWcbaGaemyAaKgabeaaaaa@2EAA@ represents data excluded from the mixture model analysis, can be expressed as

f ( Y i = y i ) = { k = 1 K η k j = 1 J B ( α k j , β k j ) 1 y i j α k j 1 ( 1 y i j ) β k j 1 } × l = J + 1 L B ( α l * , β l * ) 1 y i l α l * 1 ( 1 y i l ) β l * 1 = f ( Y i = y i ) f ˜ ( Y ˜ i = y ˜ i ) . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeWabmqaaaqaaiabdAgaMnaaCaaaleqabaGaey4fIOcaaOWaaeWaaeaacqWHzbqwdaqhaaWcbaGaemyAaKgabaGaey4fIOcaaOGaeyypa0JaeCyEaK3aa0baaSqaaiabdMgaPbqaaiabgEHiQaaaaOGaayjkaiaawMcaaiabg2da9maacmaabaWaaabmaeaacqaH3oaAdaWgaaWcbaGaem4AaSgabeaakmaaradabaGaeiOqaiKaeiikaGIaeqySde2aaSbaaSqaaiabdUgaRjabdQgaQbqabaGccqGGSaalcqaHYoGydaWgaaWcbaGaem4AaSMaemOAaOgabeaakiabcMcaPmaaCaaaleqabaGaeyOeI0IaeGymaedaaOGaemyEaK3aa0baaSqaaiabdMgaPjabdQgaQbqaaiabeg7aHnaaBaaameaacqWGRbWAcqWGQbGAaeqaaSGaeyOeI0IaeGymaedaaOGaeiikaGIaeGymaeJaeyOeI0IaemyEaK3aaSbaaSqaaiabdMgaPjabdQgaQbqabaGccqGGPaqkdaahaaWcbeqaaiabek7aInaaBaaameaacqWGRbWAcqWGQbGAaeqaaSGaeyOeI0IaeGymaedaaaqaaiabdQgaQjabg2da9iabigdaXaqaaiabdQeakbqdcqGHpis1aaWcbaGaem4AaSMaeyypa0JaeGymaedabaGaem4saSeaniabggHiLdaakiaawUhacaGL9baaaeaacaWLjaGaey41aq7aaebmaeaacqGGcbGqcqGGOaakcqaHXoqydaqhaaWcbaGaemiBaWgabaGaeiOkaOcaaOGaeiilaWIaeqOSdi2aa0baaSqaaiabdYgaSbqaaiabcQcaQaaakiabcMcaPmaaCaaaleqabaGaeyOeI0IaeGymaedaaOGaemyEaK3aa0baaSqaaiabdMgaPjabdYgaSbqaaiabeg7aHnaaDaaameaacqWGSbaBaeaacqGGQaGkaaWccqGHsislcqaIXaqmaaGccqGGOaakcqaIXaqmcqGHsislcqWG5bqEdaWgaaWcbaGaemyAaKMaemiBaWgabeaakiabcMcaPmaaCaaaleqabaGaeqOSdi2aa0baaWqaaiabdYgaSbqaaiabcQcaQaaaliabgkHiTiabigdaXaaaaeaacqWGSbaBcqGH9aqpcqWGkbGscqGHRaWkcqaIXaqmaeaacqWGmbata0Gaey4dIunaaOqaaiabg2da9iabdAgaMnaabmaabaGaeCywaK1aaSbaaSqaaiabdMgaPbqabaGccqGH9aqpcqWH5bqEdaWgaaWcbaGaemyAaKgabeaaaOGaayjkaiaawMcaaiqbdAgaMzaaiaWaaeWaaeaacuWHzbqwgaacamaaBaaaleaacqWGPbqAaeqaaOGaeyypa0JafCyEaKNbaGaadaWgaaWcbaGaemyAaKgabeaaaOGaayjkaiaawMcaaiabc6caUaaaaaa@BBA9@

The "augmented" BIC is now

a u g B I C J = ( 2 J K + K 1 + 2 L 2 J ) log ( n ) 2 i = 1 n log f ( Y i = y i ) = B I C J + 2 ( L J ) log ( n ) 2 i = 1 n log f ˜ ( Y ˜ i = y ˜ i ) , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeWabiqaaaqaaiabcggaHjabcwha1jabcEgaNjabckeacjabcMeajjabcoeadnaaBaaaleaacqWGkbGsaeqaaOGaeyypa0JaeiikaGIaeGOmaiJaemOsaOKaem4saSKaey4kaSIaem4saSKaeyOeI0IaeGymaeJaey4kaSIaeGOmaiJaemitaWKaeyOeI0IaeGOmaiJaemOsaOKaeiykaKIagiiBaWMaei4Ba8Maei4zaCMaeiikaGIaemOBa4MaeiykaKIaeyOeI0IaeGOmaiZaaabmaeaacyGGSbaBcqGGVbWBcqGGNbWzcqWGMbGzcqGGOaakcqWHzbqwdaqhaaWcbaGaemyAaKgabaGaey4fIOcaaOGaeyypa0JaeCyEaK3aa0baaSqaaiabdMgaPbqaaiabgEHiQaaakiabcMcaPaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaemOBa4ganiabggHiLdaakeaacqGH9aqpcqGGcbGqcqGGjbqscqGGdbWqdaWgaaWcbaGaemOsaOeabeaakiabgUcaRiabikdaYiabcIcaOiabdYeamjabgkHiTiabdQeakjabcMcaPiGbcYgaSjabc+gaVjabcEgaNjabcIcaOiabd6gaUjabcMcaPiabgkHiTiabikdaYmaaqadabaGagiiBaWMaei4Ba8Maei4zaCMafmOzayMbaGaacqGGOaakcuWHzbqwgaacamaaBaaaleaacqWGPbqAaeqaaOGaeyypa0JafCyEaKNbaGaadaWgaaWcbaGaemyAaKgabeaakiabcMcaPaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaemOBa4ganiabggHiLdGccqGGSaalaaaaaa@8F6D@

where BIC J is the BIC computed for just the J selected loci. The augmented BIC is now comparable across different values of J. As we have demonstrated, augBIC J leads to sensible dimension reduction. Again, an ICL version of augBIC J may be used instead.


We conducted simulations to compare the properties of our proposed method with similar competing methods. For our first case (Case I), each simulated data set consisted of n = 100 subjects, each having 1413 continuous responses lying in the unit interval. Each subject was a member of one of 5 classes, each class occurring with 0.2 probability. The classes were defined by beta-distribution parameters for each of L = 1413 methylation loci that were autosomal and passed quality-assurance, obtained by fitting a beta model on each locus to one of five data sets from our normal data: adult blood, newborn blood, placenta, lung/pleura, and everything else. Figure 3(A) illustrates a typical data set generated from these parameters. For each data set, we conducted 7 analyses, each using the J most variable loci, J {25, 50, 500, 1000}. The first analysis used hierarchical clustering, implemented using hclust in the R cluster package, with Euclidean metric and average linkage, and assigned 5 classes by cutting the resulting dendrogram at the appropriate height using the cutree function in the same package. The second analysis used the same clustering procedure, but determined the number of classes using the Dynamic Tree Cutting algorithm [28], implemented via the R package dynamicTreeCut with default settings. The third analysis used HOPACH (R hopach package) to select the "best" classes as defined in the function settings. The fourth analysis used HOPACH with classes obtained by the "greedy" version of the algorithm. The fifth analysis fit 6 sequential mixture models (1 ≤ K ≤ 6), each initialized two different ways (hierarchical clustering and the fanny algorithm), selecting the value of K producing the lowest BIC. The fifth and sixth analyses were applications of our proposed method, using ICL-BIC and BIC respectively. In the last three types of analysis, we recorded the value of J that produced the best augmented BIC. Note that each mixture model analysis tended to produce perfect classification, so that an ICL-BIC version of the time-consuming fourth analysis was deemed unnecessary.

Figure 3
figure 3

Examples of simulated data. Yellow = 1.0, black = 0.5, blue = 0.0. True classes indicated and separated by yellow dividing line. Height of region indicates the relative number of subjects in each class.

For our second case (Case II), which represented a lower-dimensional setting (L = 200) with greater variation in variance of individual beta distributions, we considered 100 subjects from 4 classes, described as follows. Four sets of 10 "informative" beta parameters were drawn randomly at the beginning of the simulation study: a1j~ Gamma(10,10), b1j~ Gamma(10,10); a2j~ Gamma(400,10), b2j~ Gamma(100,10); a3j~ Gamma(100,10), b3j~ Gamma(400,10); and a4j~ Gamma(100,1), b4j~ Gamma(250,1). These were used to construct four classes of 20 informative dimensions: α1 = (a2, a1), α2 = (a2, a4), α1 = (a3, a1), α1 = (a3, a4), where a1 = (a1j), and similarly for the β k parameters with b l = (b lj ). Each such 20-dimensional parameter was augmented with a set of 180 "noninformative" parameters, constructed as 60 copies of the vector (100,1,50) for α k and 60 copies of the vector (1,100,50) for β k . The class probabilities were respectively 0.2,0.3,0.2, and 0.3. Although the pattern corresponding to this collection of parameters may be difficult to visualize from the description, Figure 3(B) shows a typical data set generated under these conditions, and reveals a small set of informative markers, some having distinctions in mean and others in variability. Similar analyses were conducted forth is simulation, except with J {5, 10, 25, 50}, and 4 classes assumed for hierarchical clustering.

Misclassification rate was assessed for all simulated data sets and analyses. Each estimated class was matched to true class by minimizing the distance between the J means calculated according to (1). When the number of estimated classes was greater than the true number, multiple estimated classes were assigned to a single matching true class, thus generating no misclassification error when the estimated class merely partitioned the true class. When the number of estimated classes was fewer than the true number, subjects within true classes that failed to match to an estimated class were considered misclassified. In the latter case, coarsening of the true classes would lead to the smaller absorbed class being judged as misclassified. In the Results section, we showed that HOPACH tends to overestimate the number of classes for the cases we considered, so our strategy, which favors inappropriate partitioning over inappropriate coarsening, is conservative with respect to comparison with HOPACH in this set of simulations.

We conducted additional simulations, for which we omit detailed results. We used normal distributions having the same mean and standard deviation implied by the beta-based simulation described in the text. For assessing classification error, estimated classes were matched to their true classes by matching the fitted alpha and beta parameters to the corresponding parameterization of mean and standard deviation, i.e. inverting (1), in the manner described above. We conducted another simulation based on a different configuration: 200 items, each generated as a random normal with mean and standard deviations as described below, but subsequently transformed as n-1 {r i - 0.5}, where r i is the rank of the i th value, to obtain a rank-based transformation of the data. The means were generated as 25 random standard normal variables (once at the start of the simulation study) for each of 4 classes, concatenated with 175 zeroes; and the standard deviations were generated as a Gamma(5, 500) (once at the start of the simulation study) for each of 4 classes, concatenated with 175 repeats of 0.01. Note that this configuration represents a substantial departure from the beta distribution, since the marginal distribution of the data are forced to have a uniform distribution. For assessing classification error, estimated classes were matched to their true classes by matching the fitted alpha and beta parameters to the corresponding parameterization of conditional mean and standard deviation, obtained via simulation.

Validation of normal tissue results by Random Forest

To validate results, we conducted a supervised Random Forest analysis [20] using the R package randomForest with 20,000 trees and a value of 38 1413 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaeG4mamJaeGioaGJaeyisIS7aaOaaaeaacqaIXaqmcqaI0aancqaIXaqmcqaIZaWmaSqabaaaaa@335D@ (the default) for the mtry parameter (number of randomly selected variables per bootstrap). We also tried values of 14 and 76 for mtry, obtaining slightly greater classification error. Both tissue type (categorical with 11 levels) and age (continuous) were used as response variables. Detailed discussion of these results will appear in a separate manuscript written for biologists. In addition, we conducted a Random Forest analysis on the classification indices for the 9 HOPACH classes and 23 mixture model classes described in the Results section, with mtry = 9 and mtry = 23, respectively, and 20,000 trees.


An implementation of the methods described in this paper is available [see Additional file 2]. The R environment is required for the software. Additional supporting functions are available from the authors upon request.


  1. Russo V, Martienssen RA, Riggs AD: Epigenetic mechanisms of gene regulation. Cold Spring Harbor Laboratory Press; 1996.

    Google Scholar 

  2. Knudson AG: Chasing the cancer demon. Annu Rev Genet 2000, 34: 1–19. 10.1146/annurev.genet.34.1.1

    Article  CAS  PubMed  Google Scholar 

  3. Jones PA, Baylin SB: The fundamental role of epigenetic events in cancer. Nat Rev Genet 2002, 3: 415–428. 10.1038/nrg962

    Article  CAS  PubMed  Google Scholar 

  4. Sakamoto H, Suzuki M, Abe T, Hosoyama T, Himeno E, Tanaka S, Greally JM, Hattori N, Yagi S, Shiota K: Cell type-specific methylation profiles occurring disproportionately in CpG-less regions that delineate developmental similarity. Genes Cells 2007, 12: 1123–1132. 10.1111/j.1365-2443.2007.01120.x

    Article  CAS  PubMed  Google Scholar 

  5. Eckhardt F, Lewin J, Cortese R, Rakyan VK, Attwood J, Burger M, Burton J, Cox TV, Davies R, Down TA, et al.: DNA methylation profiling of human chromosomes 6, 20 and 22. Nat Genet 2006, 38: 1378–1385. 10.1038/ng1909

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  6. Fraga MF, Ballestar E, Paz MF, Ropero S, Setien F, Ballestar ML, Heine-Suner D, Cigudosa JC, Urioste M, Benitez J, et al.: Epigenetic differences arise during the lifetime of monozygotic twins. Proc Natl Acad Sci USA 2005, 102: 10604–10609. 10.1073/pnas.0500398102

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  7. Frigola J, Song J, Stirzaker C, Hinshelwood RA, Peinado MA, Clark SJ: Epigenetic remodeling in colorectal cancer results in coordinate gene suppression across an entire chromosome band. Nat Genet 2006, 38: 540–549. 10.1038/ng1781

    Article  CAS  PubMed  Google Scholar 

  8. Rakyan VK, Hildmann T, Novik KL, Lewin J, Tost J, Cox AV, Andrews TD, Howe KL, Otto T, Olek A, et al.: DNA methylation profiling of the human major histocompatibility complex: a pilot study for the human epigenome project. PLoS Biol 2004, 2: e405. 10.1371/journal.pbio.0020405

    Article  PubMed Central  PubMed  Google Scholar 

  9. Schilling E, Rehli M: Global, comparative analysis of tissue-specific promoter CpG methylation. Genomics 2007, 90: 314–323. 10.1016/j.ygeno.2007.04.011

    Article  CAS  PubMed  Google Scholar 

  10. Shann YJ, Cheng C, Chiao CH, Chen DT, Li PH, Hsu MT: Genome-Wide Mapping and Characterization of Hypomethylated Sites in Human Tissues and Breast Cancer Cell Lines. Genome Res 2008.

    Google Scholar 

  11. Song F, Smith JF, Kimura MT, Morrow AD, Matsuyama T, Nagase H, Held WA: Association of tissue-specific differentially methylated regions (TDMs) with differential gene expression. Proc Natl Acad Sci USA 2005, 102: 3336–3341. 10.1073/pnas.0408436102

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  12. Shen L, Kondo Y, Guo Y, Zhang J, Zhang L, Ahmed S, Shu J, Chen X, Waterland RA, Issa J-PJ: Genome-wide profiling of DNA methylation reveals a class of normally methylated CpG island promoters. PLOS Genetics 2007, 3: e181. 10.1371/journal.pgen.0030181

    Article  PubMed Central  Google Scholar 

  13. Siegmund KD, Laird PW, Laird-Offringa IA: A comparison of cluster analysis methods using DNA methylation data. Bioinformatics 2004, 20: 1896–1904. 10.1093/bioinformatics/bth176

    Article  CAS  PubMed  Google Scholar 

  14. Stephens M: Dealing with label switching in mixture models. Journal of the Royal Statistical Society Series B 2000, 62: 795–809. 10.1111/1467-9868.00265

    Article  Google Scholar 

  15. Ji Y, Wu C, Liu P, Wang J, Coombes KR: Applications of beta-mixture models in bioinformatics. Bioinformatics 2005, 21: 2118–2122. 10.1093/bioinformatics/bti318

    Article  CAS  PubMed  Google Scholar 

  16. Laan MJ, Pollard KS: A new algorithm for hybrid hierarchical clustering with visualization and the bootstrap. Journal of Statistical Planning and Inference 2003, 117: 275–303. 10.1016/S0378-3758(02)00388-9

    Article  Google Scholar 

  17. Kaufman L, Rousseeuw PJ: Finding Groups in Data: An Introduction to Cluster Analysis. New York: Wiley; 1990.

    Chapter  Google Scholar 

  18. Hastie T, Tibshirani R, Friedman J: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. New York: Springer; 2001.

    Chapter  Google Scholar 

  19. Breiman L, Friedman JH, Olshen RA, Stone CJ: Classification and Regression Trees. Boca Raton, Florida: Chapman & Hall; 1984.

    Google Scholar 

  20. Breiman L: Random Forests. Machine Learning 2001, 45: 5–32. 10.1023/A:1010933404324

    Article  Google Scholar 

  21. Tibshirani R, Walther G, Hastie T: Estimating the number of clusters in a dataset via the gap statistic. J Royal Statist Soc B 2001, 63: 411–423. 10.1111/1467-9868.00293

    Article  Google Scholar 

  22. Houseman EA, Coull BA, Betensky RA: Feature-specific penalized latent class analysis for genomicdata. Biometrics 2006, 62: 1062–1070. 10.1111/j.1541-0420.2006.00566.x

    Article  PubMed  Google Scholar 

  23. Bair E, Tibshirani R: Semi-Supervised Methods to Predict Patient Survival from Gene Expression Data. PLoS Biol 2004, 2: 1544–9173. 10.1371/journal.pbio.0020108

    Article  Google Scholar 

  24. Lefkopoulou M, Moore D, Ryan L: The analysis of multiple correlated binary outcomes: application to rodent teratology experiments. Journal of the American Statistical Association 1989, 84: 810–815. 10.2307/2289671

    Article  Google Scholar 

  25. Dempster A, Laird N, Rubin D: Maximum likelihood from incomplete data via the EM algorithm (with discussion). J R Statist Soc B 1977, 39: 1–38.

    Google Scholar 

  26. Leroux BG, Puterman ML: Maximum-Penalized-Likelihood Estimation for Independent and Markov-Dependent Mixture Models. Biometrics 1992, 48: 545–558. 10.2307/2532308

    Article  CAS  PubMed  Google Scholar 

  27. Fraley C, Raftery AE: Bayesian regularization for normal mixture estimation and model-based clustering. Department of Statistics, University of Washington; 2005.

    Google Scholar 

  28. Langfelder P, Zhang B, Horvath S: Defining clusters from a hierarchical cluster tree: the Dynamic Tree Cut library for R. Bioinformatics 2008, 24: 719–720. 10.1093/bioinformatics/btm563

    Article  CAS  PubMed  Google Scholar 

Download references


Supported by: Mesothelioma Applied Research Foundation grant, NIH/NIEHS Training grant in environmental health sciences T32ES007155, NIH/NIEHS grant P42ES05947, and NCI grants CA48061, CA126939, CA078609, CA100679, CA121147, and FAMRI.

Author information

Authors and Affiliations


Corresponding author

Correspondence to E Andres Houseman.

Additional information

Authors' contributions

EAH developed statistical methodology, with critical intellectual input from RFY. BCC prepared laboratory samples and coordinated analysis with Illumina; BCC and CJM participated in testing software on methylation data obtained from real tissues. CJM, MRK, MW, HHN, JW, SZ, JKW, and KTK contributed tissue samples. All eleven authors participated in weekly conference calls and discussed the biological implications of the analytical methods.

Electronic supplementary material


Additional file 1: Distribution of DNA methylation average beta values by tissue type at least variable locus. (JPEG 60 KB)

Additional file 2: RPMM Software Public Release 1-1. Compressed folder containing R code with examples on simulated data. (ZIP 114 KB)

Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

Authors’ original file for figure 1

Authors’ original file for figure 2

Authors’ original file for figure 4

Rights and permissions

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Houseman, E.A., Christensen, B.C., Yeh, RF. et al. Model-based clustering of DNA methylation array data: a recursive-partitioning algorithm for high-dimensional data arising as a mixture of beta distributions. BMC Bioinformatics 9, 365 (2008).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: