.png){kind=icon}
返回
Row-Sparse Principal Component Analysis via Coordinate Descent Method
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2024.3351851.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Row-sparse
principal component analysis
coordinate descent
feature selection
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
The Association between Pathological Internet Use and Comorbid Psychopathology: A Systematic Review
OAAI
.png){kind=icon}
OAAI分享收藏
查看更多内容