Name
Abstract | ||
|---|---|---|
Sparse principal component analysis (SPCA) has emerged as a powerful technique for modern data analysis, providing improved interpretation of low-rank structures by identifying localized spatial structures in the data and disambiguating between distinct time scales. We demonstrate a robust and scalable SPCA algorithm by formulating it as a value-function optimization problem. This viewpoint leads to a flexible and computationally efficient algorithm. The approach can further leverage randomized methods from linear algebra to extend SPCA to the large-scale (big data) setting. Our proposed innovation also allows for a robust SPCA formulation which obtains meaningful sparse principal components in spite of grossly corrupted input data. The proposed algorithms are demonstrated using both synthetic and real world data, and show exceptional computational efficiency and diagnostic performance. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1137/18M1211350 | SIAM JOURNAL ON APPLIED MATHEMATICS |
Keywords | DocType | Volume |
dimension reduction,sparse principal component analysis,randomized algorithms,variable projection | Journal | 80 |
Issue | ISSN | Citations |
2 | 0036-1399 | 1 |
PageRank | References | Authors |
0.35 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| n benjamin erichson | 1 | 26 | 5.69 |
| Peng Zheng | 2 | 1 | 1.02 |
| Krithika Manohar | 3 | 4 | 1.53 |
| S. L. Brunton | 4 | 141 | 23.92 |
| J. Nathan Kutz | 5 | 225 | 47.13 |
| Aleksandr Y. Aravkin | 6 | 252 | 32.68 |