返回
Automatic Subspace Learning via Principal Coefficients Embedding
DOI:10.1109/TCYB.2016.2572306.png)
摘要
En 中文
In this paper, we address two challenging problems in unsupervised subspace learning: 1) how to automatically identify the feature dimension of the learned subspace (i.e., automatic subspace learning) and 2) how to learn the underlying subspace in the presence of Gaussian noise (i.e., robust subspace learning). We show that these two problems can be simultaneously solved by proposing a new method [(called principal coefficients embedding (PCE)]. For a given data set D is an element of R-mxn, PCE recovers a clean data set D-0 is an element of R-mxn from D and simultaneously learns a global reconstruction relation C is an element of R-nxn of D-0. By preserving C into an m'-dimensional space, the proposed method obtains a projection matrix that can capture the latent manifold structure of D-0, where m' << m is automatically determined by the rank of C with theoretical guarantees. PCE has three advantages: 1) it can automatically determine the feature dimension even though data are sampled from a union of multiple linear subspaces in presence of the Gaussian noise; 2) although the objective function of PCE only considers the Gaussian noise, experimental results show that it is robust to the non-Gaussian noise (e.g., random pixel corruption) and real disguises; and 3) our method has a closed-form solution and can be calculated very fast. Extensive experimental results show the superiority of PCE on a range of databases with respect to the classification accuracy, robustness, and efficiency.
Keyword:
Automatic dimension reduction
corrupted data
graph embedding
manifold learning
robustness
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Immunization onto bare skin with heat‐labile enterotoxin of Escherichia coli enhances immune responses to coadministered protein and peptide antigens and protects mice against lethal toxin challenge
Immunology
IF0

