Adaptive Weighted Sparse Principal Component Analysis

In this paper, we propose an unsupervised feature selection method from the perspective of optimal reconstruction. The features selected by the proposed method can well represent the original data, and the effectiveness of the selected features is demonstrated by robust reconstruction and clustering. The proposed method emphasizes the joint $\ell_{2, 1}$-norms minimization on both reconstruction term and regularization term to make them be column-sparse. Relying on the column-sparse property of reconstruction term and regularization term, the proposed method is able to improve the robustness to outliers and select the effective features. The proposed objective function is nonconvex. Fortunately, it can be equivalently reformulated as a convex form (with change of variables) to capture a global optimization solution. In fact, the proposed method is related to the optimal mean robust principal component analysis (OMRPCA) because the proposed method is a sparse self-contained regression type of OMRPCA. Since OMRPCA essentially adds the adaptive weights for data samples, we call the proposed method adaptive weighted sparse principal component analysis (AW-SPCA). Experimental results demonstrate the effectiveness of AW-SPCA.

[1]  Zi Huang,et al.  Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence ℓ2,1-Norm Regularized Discriminative Feature Selection for Unsupervised Learning , 2022 .

[2]  R. Tibshirani,et al.  Sparse Principal Component Analysis , 2006 .

[3]  Xuelong Li,et al.  Unsupervised Feature Selection with Structured Graph Optimization , 2016, AAAI.

[4]  Chris H. Q. Ding,et al.  R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization , 2006, ICML.

[5]  ChengXiang Zhai,et al.  Robust Unsupervised Feature Selection , 2013, IJCAI.

[6]  Michael J. Black,et al.  Robust Principal Component Analysis for Computer Vision , 2001, ICCV.

[7]  Avinash C. Kak,et al.  PCA versus LDA , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Terence Sim,et al.  The CMU Pose, Illumination, and Expression (PIE) database , 2002, Proceedings of Fifth IEEE International Conference on Automatic Face Gesture Recognition.

[9]  Takeo Kanade,et al.  Robust L/sub 1/ norm factorization in the presence of outliers and missing data by alternative convex programming , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[10]  Nojun Kwak,et al.  Principal Component Analysis Based on L1-Norm Maximization , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Zhenyu He,et al.  Joint sparse principal component analysis , 2017, Pattern Recognit..

[12]  Changsheng Xu,et al.  Inductive Robust Principal Component Analysis , 2012, IEEE Transactions on Image Processing.

[13]  John Wright,et al.  Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization , 2009, NIPS.

[14]  Alex Pentland,et al.  Face recognition using eigenfaces , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[15]  Michael J. Black,et al.  A Framework for Robust Subspace Learning , 2003, International Journal of Computer Vision.

[16]  Feiping Nie,et al.  Trace Ratio Criterion for Feature Selection , 2008, AAAI.

[17]  Feiping Nie,et al.  Optimal Mean Robust Principal Component Analysis , 2014, ICML.

[18]  Lei Wang,et al.  Efficient Spectral Feature Selection with Minimum Redundancy , 2010, AAAI.

[19]  Feiping Nie,et al.  Efficient and Robust Feature Selection via Joint ℓ2, 1-Norms Minimization , 2010, NIPS.

[20]  Feiping Nie,et al.  Robust Principal Component Analysis with Non-Greedy l1-Norm Maximization , 2011, IJCAI.

[21]  Jiawei Han,et al.  Spectral Regression: A Unified Approach for Sparse Subspace Learning , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).