Joint L1/2-Norm Constraint and Graph-Laplacian PCA Method for Feature Extraction.

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 algori...

Descripción completa

Detalles Bibliográficos
Publicado en:	BioMed Research International Vol. 2017; pp. 1 - 15
Autores principales:	Feng, Chun-Mei, Gao, Ying-Lian, Liu, Jin-Xing, Wang, Juan, Wang, Dong-Qin, Wen, Chang-Gang
Formato:	algorithm equations & formulas research Journal Article
Publicado:	Wiley-Blackwell 4/2/2017
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	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.