A graph-Laplacian PCA based on L1/2-norm constraint for characteristic gene selection

Chun-Mei Feng, Jin-Xing Liu, Ying-Lian Gao, Juan Wang, Dong-Qin Wang, Yong DuBIBM 2016 · OpenReview

Abstract

Principal Component Analysis (PCA) as a tool for dimensionality reduction is widely used in many areas. In the area of bioinformatics, the first principal component of PCA is used to select characteristic genes. In order to improve the robustness of PCA-based method, this paper proposes a novel graph-Laplacian PCA algorithm by adopting L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1/2</sub> constraint on error function (L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1/2</sub> gLPCA) for characteristic gene selection. Augmented Lagrange Multipliers (ALM) method is applied to solve the sub-problem. This method gets better results in characteristic gene selection than traditional PCA approach. Meanwhile, the error function based on the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1/2</sub> norm helps to reduce the influence of outliers and noise. Extensive experimental results on gene expression data sets demonstrate that our method can get higher identification accuracies than others.
BibTeX
@inproceedings{feng2016graph,
  author = {Chun-Mei Feng and Jin-Xing Liu and Ying-Lian Gao and Juan Wang and Dong-Qin Wang and Yong Du},
  title = {{A graph-Laplacian PCA based on L1/2-norm constraint for characteristic gene selection}},
  booktitle = {BIBM},
  year = {2016},
  url = {https://openreview.net/forum?id=hulNWIPFIa},
}

Loading related content...

Figure