Skin Cutaneous Melanoma: Clustering of copy number data by focal peak region with log2 ratio: consensus NMF
(NF1_Any_Mutants cohort)
Maintained by TCGA GDAC Team (Broad Institute/MD Anderson Cancer Center/Harvard Medical School)
Overview
Introduction

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 focal events for each subtype.

Summary

The most robust consensus NMF clustering of 31 samples using the 19 copy number focal regions was identified for k = 2 clusters. We computed the clustering for k = 2 to k = 8 and used the cophenetic correlation coefficient to determine the best solution.

Results
Copy number focal events of molecular subtypes

Figure 1.  Get High-res Image Samples were separated into 2 clusters. Shown are 31 samples and 12 marker focal events. The color bar of the row indicates the marker focal events for the corresponding cluster.

Figure 2.  Get High-res Image Heatmap with a standard hierarchical clustering for 31 samples and the 19 focal events.

Consensus and correlation matrix

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

Figure 4.  Get High-res Image The correlation matrix also shows 2 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 2 subtypes and silhouette width.

SampleName cluster silhouetteValue
TCGA-D3-A2JA-06A-11D-A194-01 1 0.38
TCGA-D3-A2JF-06A-11D-A194-01 1 0.32
TCGA-DA-A1I0-06A-11D-A20B-01 1 0.32
TCGA-EE-A17X-06A-11D-A191-01 1 0.32
TCGA-EE-A181-06A-11D-A194-01 1 0.16
TCGA-EE-A20C-06A-11D-A194-01 1 0.42
TCGA-EE-A29N-06A-12D-A191-01 1 0.52
TCGA-EE-A2A2-06A-11D-A194-01 1 0.19
TCGA-EE-A2GC-06A-11D-A191-01 1 0.35
TCGA-EE-A2MJ-06A-11D-A191-01 1 0.56

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-D3-A2JA-06A-11D-A194-01 1 1 1 1 1 1 1
TCGA-D3-A2JF-06A-11D-A194-01 1 2 1 1 1 2 2
TCGA-DA-A1I0-06A-11D-A20B-01 1 1 1 1 1 3 3
TCGA-EE-A17X-06A-11D-A191-01 1 1 1 1 1 3 3
TCGA-EE-A181-06A-11D-A194-01 1 1 1 2 2 4 1
TCGA-EE-A20C-06A-11D-A194-01 1 1 1 1 1 3 3
TCGA-EE-A29N-06A-12D-A191-01 1 1 1 1 1 3 3
TCGA-EE-A2A2-06A-11D-A194-01 1 1 4 4 4 1 1
TCGA-EE-A2GC-06A-11D-A191-01 1 2 1 1 1 3 3
TCGA-EE-A2MJ-06A-11D-A191-01 1 1 1 1 1 3 3
Marker focal events 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 focal events for each subtype by comparing the subclass versus the other subclasses, using Student's t-test.

Table 3.  Get Full Table List of marker focal events with p <= 0.05.

Composite.Element.REF p difference q subclass
DEL PEAK 6(9P21.3) 0.0023 0.6 0.022 1
DEL PEAK 9(11Q24.3) 0.0005 0.42 0.0096 1
DEL PEAK 5(6Q23.2) 0.008 0.41 0.038 1
DEL PEAK 1(1P36.31) 0.042 0.28 0.15 1
AMP PEAK 2(1Q44) 0.0037 -0.9 0.024 1
AMP PEAK 1(1P12) 0.047 -0.96 0.15 1
AMP PEAK 1(1P12) 0.047 0.96 0.15 2
AMP PEAK 2(1Q44) 0.0037 0.9 0.024 2
DEL PEAK 1(1P36.31) 0.042 -0.28 0.15 2
DEL PEAK 5(6Q23.2) 0.008 -0.41 0.038 2
Methods & Data
Input

Copy number data file = All Lesions File actual copy number part (all_lesions.conf_##.txt, where ## is the confidence level). The all lesions file is from GISTIC pipeline and summarizes the results from the GISTIC run. It contains data about the significant regions of amplification and deletion as well as which samples are amplified or deleted in each of these regions. The identified regions are listed down the first column, and the samples are listed across the first row, starting in column 10

CNMF Method

Non-negative matrix factorization (NMF) is an unsupervised learning algorithm that has been shown to identify molecular patterns when applied to gene expression data , . Rather than separating gene clusters based on distance computation, NMF detects contextdependent patterns of gene 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.

References
[1] Brunet, J.P., Tamayo, P., Golub, T.R. & Mesirov, J.P., Metagenes 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)