Joint L1/2 -norm constraint and graph-Laplacian PCA method for feature extraction

12Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Principal Component Analysis (PCA) as a tool for dimensionality reduction is widely used in many areas. In the area of bioinformatics, each involved variable corresponds to a specific gene. In order to improve the robustness of PCA-based method, this paper proposes a novel graph-Laplacian PCA algorithm by adopting L1/2 constraint (L1/2 gLPCA) on error function for feature (gene) extraction. The error function based on L1/2-norm helps to reduce the influence of outliers and noise. Augmented Lagrange Multipliers (ALM) method is applied to solve the subproblem. This method gets better results in feature extraction than other state-of-the-art PCA-based methods. Extensive experimental results on simulation data and gene expression data sets demonstrate that our method can get higher identification accuracies than others.

Cite

CITATION STYLE

APA

Feng, C. M., Gao, Y. L., Liu, J. X., Wang, J., Wang, D. Q., & Wen, C. G. (2017). Joint L1/2 -norm constraint and graph-Laplacian PCA method for feature extraction. BioMed Research International, 2017. https://doi.org/10.1155/2017/5073427

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free