This pipeline calculates clusters based on a consensus non-negative matrix factorization (NMF) clustering method , . This pipeline has the following features:
Convert input data set to a non-negitive matrix by column rank normalization.
Classify samples into consensus clusters.
Determine differentially expressed marker miRs for each subtype.
The most robust consensus NMF clustering of 337 samples using the 647 most variable miRs was identified for k = 4 clusters. We computed the clustering for k = 2 to k = 10 and uused the cophenetic correlation coefficient and the average silhouette width calculation to determine the robust clusters.
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 miRs for each subtype by comparing the subclass versus the other subclasses, using Student's t-test.
miRseq (MIMATs) of RPM value (reads per million reads aligned to miRBase mature) with log2 transformed was as the input data for the clustering.
Input file for selecting top 647 genes = *.miRseq_mature_RPM_log2.txt from miRseq_Mature_Preprocess
Input file for the clustering module = /xchip/cga/gdac-prod/tcga-gdac/jobResults/GDAC_TopgenesforCluster/LUSC-TP/22507488/LUSC-TP.expclu.gct
Non-negative matrix factorization (NMF) is an unsupervised learning algorithm that has been shown to identify molecular patterns when applied to miR expression data , . Rather than separating miR clusters based on distance computation, NMF detects contextdependent patterns of miR expression in complex biological systems.
We use the cophenetic correlation coefficients 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 coefficients and average silhouette values are used to determine the k with the most robust clusterings. From the plot of cophenetic correlation versus k, we select modes and the the point preceding the greatest decrease in cophenetic correlation coefficient, and from these choose the k with the highest average silhouette value.
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 .
In addition to the links below, the full results of the analysis summarized in this report can also be downloaded programmatically using firehose_get, or interactively from either the Broad GDAC website or TCGA Data Coordination Center Portal.