PCA via joint graph Laplacian and sparse constraint: Identification of differentially expressed genes and sample clustering on gene expression data

Chun-Mei Feng, Yong Xu, Mi-Xiao Hou, Ling-Yun Dai, Junliang ShangBMC Bioinformatics 2019 · OpenReview

TL;DR

This paper introduces gLSPCA, a novel method that enhances Principal Component Analysis (PCA) for gene expression data by incorporating both graph Laplacian and sparse constraints. This dual approach improves the identification of differentially expressed genes crucial for cancer diagnosis and enhances sample clustering for better tumor subtyping.

What Problem Does This Paper Address?

In bioinformatics, understanding gene expression differences is key to identifying disease-related genes and classifying disease subtypes. Principal Component Analysis (PCA) is a common tool for this, but it has limitations. Firstly, traditional PCA overlooks the inherent geometric structure (like pairwise distances) within the data, which is vital for accurate sample clustering. Secondly, PCA often produces "dense" principal components (PCs), meaning they involve many genes, making it difficult to pinpoint the few truly significant genes associated with diseases like cancer. Identifying these sparse, impactful genes is crucial for early diagnosis and targeted treatment.

Methods

The core innovation of this paper is the proposed gLSPCA method, which integrates two key concepts into PCA:

  • Graph Laplacian: This component leverages the geometric structure of the data. By constructing a graph where nodes represent samples and edges represent similarity, the graph Laplacian helps capture the underlying manifold structure of the gene expression data. This is particularly useful for improving sample clustering accuracy.
  • Sparse Constraint (L2,1-norm): To address the issue of dense PCs, gLSPCA imposes a sparsity constraint. Specifically, it uses the L2,1-norm on the principal components (H). This encourages the PCs to have fewer non-zero elements, making them more interpretable and facilitating the identification of a small set of highly relevant genes.

The method formulates an optimization problem that jointly minimizes the reconstruction error (standard PCA objective), the graph Laplacian term (for geometric structure), and the L2,1-norm term (for sparsity). The optimization is performed iteratively, alternating between updating the principal directions (U) and the projected data (H).

Datasets

The study evaluates gLSPCA using two real-world gene expression datasets:

  • Pancreatic Cancer (PAAD): Downloaded from The Cancer Genome Atlas (TCGA).
  • Head and Neck Squamous Carcinoma (HNSC): Also downloaded from TCGA.

These datasets are characterized by a large number of genes (over 20,000) and a relatively small number of samples, making them challenging for analysis and highlighting the need for effective dimensionality reduction and feature selection.

Key Insights and Ideas

  • Synergy of Graph Laplacian and Sparsity: The paper demonstrates that combining geometric information (graph Laplacian) with sparsity constraints is more effective than using either alone for both gene identification and sample clustering.
  • Interpretable Genes for Cancer: By forcing PCs to be sparse, gLSPCA can identify a small set of genes that are highly correlated with cancer, offering potential biomarkers for early diagnosis and treatment.
  • Improved Sample Clustering: The incorporation of the graph Laplacian allows gLSPCA to better capture the underlying relationships between samples, leading to more accurate tumor subtype classification.
  • Novel Cancer Gene Candidates: The method identified specific genes (e.g., PPY, CD24 for PAAD; HSPA1A, COL6A1 for HNSC) that were not identified by other methods and showed high relevance scores, suggesting they are important candidates for further biological investigation.

Key Results

  • Differential Gene Identification: gLSPCA achieved higher Identification Accuracy (IA) and Total Relevance Scores (TRS) compared to other methods (Z-SPCA, GPower, PathSPCA, SPCArt, gLPCA) on both PAAD and HNSC datasets. For example, on the PAAD dataset, gLSPCA achieved an IA of 80.00 and TRS of 927.70, outperforming others.
  • Sample Clustering: gLSPCA demonstrated superior performance in tumor sample clustering, achieving the highest Accuracy (ACC) scores on both datasets. On PAAD, gLSPCA achieved an ACC of 97.22, while on HNSC, it reached 92.88. This significantly outperformed other methods, including a baseline "All-Ge" (all genes without reduction) approach.
  • Venn Diagram Analysis: The Venn diagrams showed that gLSPCA identified unique genes that were highly related to the disease, suggesting their potential as new oncogenes.

Limitations and Future Work

  • Parameter Tuning: The paper mentions that the best parameters for gLSPCA were selected through experimentation, implying that parameter tuning can be a factor in achieving optimal results.
  • Further Biological Validation: While the paper identifies potential new oncogenes and pathways, further in-depth biological studies are needed to fully validate these findings and explore their clinical implications.
  • Exploration of Causative Factors: The applications of gLSPCA on the datasets provided "several new clues for the exploration of causative factors of PAAD and HNSC," suggesting that future work could delve deeper into these clues.

Summary updated

Abstract

Background In recent years, identification of differentially expressed genes and sample clustering have become hot topics in bioinformatics. Principal Component Analysis (PCA) is a widely used method in gene expression data. However, it has two limitations: first, the geometric structure hidden in data, e.g., pair-wise distance between data points, have not been explored. This information can facilitate sample clustering; second, the Principal Components (PCs) determined by PCA are dense, leading to hard interpretation. However, only a few of genes are related to the cancer. It is of great significance for the early diagnosis and treatment of cancer to identify a handful of the differentially expressed genes and find new cancer biomarkers. Results In this study, a new method gLSPCA is proposed to integrate both graph Laplacian and sparse constraint into PCA. gLSPCA on the one hand improves the clustering accuracy by exploring the internal geometric structure of the data, on the other hand identifies differentially expressed genes by imposing a sparsity constraint on the PCs. Conclusions Experiments of gLSPCA and its comparison with existing methods, including Z-SPCA, GPower, PathSPCA, SPCArt, gLPCA, are performed on real datasets of both pancreatic cancer (PAAD) and head & neck squamous carcinoma (HNSC). The results demonstrate that gLSPCA is effective in identifying differentially expressed genes and sample clustering. In addition, the applications of gLSPCA on these datasets provide several new clues for the exploration of causative factors of PAAD and HNSC.
BibTeX
@article{feng2019pca,
  author = {Chun-Mei Feng and Yong Xu and Mi-Xiao Hou and Ling-Yun Dai and Junliang Shang},
  title = {{PCA via joint graph Laplacian and sparse constraint: Identification of differentially expressed genes and sample clustering on gene expression data}},
  journal = {BMC Bioinformatics},
  year = {2019},
  url = {https://openreview.net/forum?id=X_04LM40s6v},
}
Figure