Name
Abstract | ||
|---|---|---|
Rank minimization is widely used to extract low-dimensional subspaces. As a convex relaxation of the rank minimization, the problem of nuclear norm minimization has been attracting widespread attention. However, the standard nuclear norm minimization usually results in overcompression of data in all subspaces and eliminates the discrimination information between different categories of data. To overcome these drawbacks, in this article, we introduce the label information into the nuclear norm minimization problem and propose a labeled-robust principal component analysis (L-RPCA) to realize nuclear norm minimization on multisubspace data. Compared with the standard nuclear norm minimization, our method can effectively utilize the discriminant information in multisubspace rank minimization and avoid excessive elimination of local information and multisubspace characteristics of the data. Then, an effective labeled-robust regression (L-RR) method is proposed to simultaneously recover the data and labels of the observed data. Experiments on real datasets show that our proposed methods are superior to other state-of-the-art methods. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TCYB.2020.3026101 | IEEE Transactions on Cybernetics |
Keywords | DocType | Volume |
Algorithms,Principal Component Analysis | Journal | 52 |
Issue | ISSN | Citations |
6 | 2168-2267 | 0 |
PageRank | References | Authors |
0.34 | 36 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deyu Zeng | 1 | 1 | 1.37 |
| Zongze Wu | 2 | 65 | 11.45 |
| Chris Ding | 3 | 9308 | 501.21 |
| Zhigang Ren | 4 | 21 | 3.97 |
| Qingyu Yang | 5 | 0 | 0.34 |
| Shengli Xie | 6 | 2530 | 161.51 |