Row-Sparse Principal Component Analysis via Coordinate Descent Method

Feiping Nie, Qiang Chen, Weizhong Yu, Xuelong Li

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

In this paper, we propose a novel algorithm to solve the row-sparse principal component analysis problem without relying on any data structure assumption. Sparse principal component analysis was proposed to improve the interpretability of principal component analysis by restricting the number of non-zero elements in each loading vector, but the varying sparsity patterns among different leading vectors may result in trouble on some occasions, such as feature selection. Then row-sparse principal component analysis was proposed, which demands the same sparse pattern among different loading vectors. However, the optimization of row-sparse principal component analysis problems is NP-hard. Although some algorithms were proposed to solve this problem, but they are only applicable to the specific data structure. In this paper, we transform the original row-sparse principal component analysis problem into a new equivalent problem that can be solved by coordinate descent method without relying on any data structure assumption. Then by carefully eliminating redundant structures to avoid repeating computation, we propose a more efficient coordinate descent method to solve this problem. Furthermore, no parameter needs to be tuned in our algorithm. Finally, extensive experiments are conducted on the real world data sets to demonstrate the superiority of our algorithm.

Original languageEnglish
Pages (from-to)3460-3471
Number of pages12
JournalIEEE Transactions on Knowledge and Data Engineering
Volume36
Issue number7
DOIs
StatePublished - 1 Jul 2024

Keywords

  • coordinate descent
  • feature selection
  • principal component analysis
  • Row-sparse

Fingerprint

Dive into the research topics of 'Row-Sparse Principal Component Analysis via Coordinate Descent Method'. Together they form a unique fingerprint.

Cite this