Clustering of RPPA data: consensus NMF
Uterine Corpus Endometrioid Carcinoma (Primary solid tumor)
21 April 2013  |  analyses__2013_04_21
Maintainer Information
Citation Information
Maintained by TCGA GDAC Team (Broad Institute/MD Anderson Cancer Center/Harvard Medical School)
Cite as Broad Institute TCGA Genome Data Analysis Center (2013): Uterine Corpus Endometrioid Carcinoma (Primary solid tumor cohort) - 21 April 2013: Clustering of RPPA data: consensus NMF. Broad Institute of MIT and Harvard. doi:10.7908/C1DR2SGX

This pipeline calculates clusters based on a consensus non-negative matrix factorization (NMF) clustering method , . This pipeline has the following features:

  1. Convert input data set to a non-negitive matrix by column rank normalization.

  2. Classify samples into consensus clusters.

  3. Determine differentially expressed marker proteins for each subtype.


The most robust consensus NMF clustering of 200 samples using 166 proteins was identified for k = 6 clusters. We computed the clustering for k = 2 to k = 8 and used the cophenetic correlation coefficient to determine the best solution.

Protein expression patterns of molecular subtypes

Figure 1.  Get High-res Image Samples were separated into 6 clusters. Shown are 200 samples and 166 marker proteins. The color bar of the row indicates the marker proteins for the corresponding cluster.

Figure 2.  Get High-res Image Heatmap with a standard hierarchical clustering for 200 samples and the 166 proteins.

Consensus and correlation matrix

Figure 3.  Get High-res Image The consensus matrix after clustering shows 6 clusters with limited overlap between clusters.

Figure 4.  Get High-res Image The correlation matrix also shows 6 clusters.

Silhouette widths

Figure 5.  Get High-res Image The silhouette width was calculated for each sample and each value of k. The left panel shows the average silhouette width across all samples for each tested k (left panel). The right panels shows assignments of clusters to samples and the silhouette width of each sample for the most robust clustering.

Samples assignment with silhouette width

Table 1.  Get Full Table List of samples with 6 subtypes and silhouette width.

SampleName cluster silhouetteValue
TCGA-A5-A0G1-01A-21-A162-20 1 0.068
TCGA-A5-A0GE-01A-21-A162-20 1 0.37
TCGA-A5-A0GQ-01A-21-A162-20 1 0.4
TCGA-A5-A0GR-01A-21-A162-20 1 0.048
TCGA-A5-A0R8-01A-21-A163-20 1 0.3
TCGA-A5-A0RA-01A-11-A163-20 1 0.079
TCGA-A5-A0VP-01A-11-A163-20 1 0.25
TCGA-AP-A059-01A-11-A162-20 1 0.097
TCGA-AP-A05J-01A-21-A162-20 1 0.043
TCGA-AP-A0LF-01A-21-A162-20 1 0.08

Table 2.  Get Full Table List of samples belonging to each cluster in different k clusters.

SampleName K=2 K=3 K=4 K=5 K=6 K=7 K=8
TCGA-A5-A0G1-01A-21-A162-20 1 1 1 1 1 1 1
TCGA-A5-A0G5-01A-21-A162-20 1 1 2 2 2 2 2
TCGA-A5-A0GE-01A-21-A162-20 1 1 1 1 1 1 1
TCGA-A5-A0GQ-01A-21-A162-20 1 1 1 1 1 1 1
TCGA-A5-A0GR-01A-21-A162-20 1 1 1 1 1 1 6
TCGA-A5-A0GU-01A-21-A162-20 1 3 3 3 5 6 5
TCGA-A5-A0GV-01A-21-A162-20 1 1 1 2 2 2 2
TCGA-A5-A0GW-01A-21-A162-20 1 1 2 2 2 2 2
TCGA-A5-A0R6-01A-21-A163-20 1 3 2 2 2 2 2
TCGA-A5-A0R7-01A-21-A162-20 1 1 1 2 2 2 2
Marker proteins of each subtype

Samples most representative of the clusters, hereby called core samples were identified based on positive silhouette width, indicating higher similarity to their own class than to any other class member. Core samples were used to select differentially expressed marker proteins for each subtype by comparing the subclass versus the other subclasses, using Student's t-test.

Table 3.  Get Full Table List of marker proteins with p <= 0.05 (The positive value of column difference means protein is upregulated in this subtype and vice versa).

Composite.Element.REF p difference q subclass
ANXA1|ANNEXIN_I-R-V 6e-06 0.75 0.000028 1
CASP7|CASPASE-7_CLEAVEDD198-R-C 0.0024 0.67 0.0056 1
VASP|VASP-R-C 6.8e-10 0.64 1e-08 1
MAPK14|P38_PT180_Y182-R-V 0.00068 0.6 0.0018 1
CHEK1|CHK1-R-C 4.4e-10 0.57 7.3e-09 1
CLDN7|CLAUDIN-7-R-V 0.0045 0.55 0.0092 1
CCNE1|CYCLIN_E1-M-V 0.00014 0.51 0.00046 1
SRC|SRC_PY527-R-V 0.034 0.47 0.055 1
DIABLO|SMAC-M-V 0.00031 0.47 0.0009 1
SRC|SRC_PY416-R-C 0.002 0.47 0.0048 1
Methods & Data

The RPPA Level 3 data was used as the input for clustering; protein measurements correted by median centering across antibodies.

CNMF Method

Non-negative matrix factorization (NMF) is an unsupervised learning algorithm that has been shown to identify molecular patterns when applied to protein expression data , . Rather than separating protein clusters based on distance computation, NMF detects contextdependent patterns of protein expression in complex biological systems.

Cophenetic Correlation Coefficient

We use the cophenetic correlation coefficient to determine the cluster that yields the most robust clustering. The cophenetic correlation coefficient is computed based on the consensus matrix of the CNMF clustering, and measures how reliably the same samples are assigned to the same cluster across many iterations of the clustering lgorithm with random initializations. The cophenetic correlation coefficient lies between 0 and 1, with higher values indicating more stable cluster assignments. We select the number of clusters k based on the largest observed correlation coefficient for all tested values of k.

Silhouette Width

Silhouette width is defined as the ratio of average distance of each sample to samples in the same cluster to the smallest distance to samples not in the same cluster. If silhouette width is close to 1, it means that sample is well clustered. If silhouette width is close to -1, it means that sample is misclassified .

Download Results

This is an experimental feature. The full results of the analysis summarized in this report can be downloaded from the TCGA Data Coordination Center.

[1] Brunet, J.P., Tamayo, P., Golub, T.R. & Mesirov, J.P., Metaproteins and molecular pattern discovery using matrix factorization, Proc Natl Acad Sci U S A 12(101):4164-9 (2004)
[3] Rousseeuw, P.J., Silhouettes: A graphical aid to the interpretation and validation of cluster analysis., J. Comput. Appl. Math. 20:53-65 (1987)