Name
Title | ||
|---|---|---|
Joint Label Prediction Based Semi-Supervised Adaptive Concept Factorization for Robust Data Representation |
Abstract | ||
|---|---|---|
Constrained Concept Factorization (CCF) yields the enhanced representation ability over CF by incorporating label information as additional constraints, but it cannot classify and group unlabeled data appropriately. Minimizing the difference between the original data and its reconstruction directly can enable CCF to model a small noisy perturbation, but is not robust to gross sparse errors. Besides, CCF cannot preserve the manifold structures in new representation space explicitly, especially in an adaptive manner. In this paper, we propose a joint label prediction based Robust Semi-Supervised Adaptive Concept Factorization (RS
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>
ACF) framework. To obtain robust representation, RS
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>
ACF relaxes the factorization to make it simultaneously stable to small entrywise noise and robust to sparse errors. To enrich prior knowledge to enhance the discrimination, RS
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>
ACF clearly uses class information of labeled data and more importantly propagates it to unlabeled data by jointly learning an explicit label indicator for unlabeled data. By the label indicator, RS
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>
ACF can ensure the unlabeled data of the same predicted label to be mapped into the same class in feature space. Besides, RS
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>
ACF incorporates the joint neighborhood reconstruction error over the new representations and predicted labels of both labeled and unlabeled data, so the manifold structures can be preserved explicitly and adaptively in the representation space and label space at the same time. Owing to the adaptive manner, the tricky process of determining the neighborhood size or kernel width can be avoided. Extensive results on public databases verify that our RS
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>
ACF can deliver state-of-the-art data representation, compared with other related methods. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TKDE.2019.2893956 | IEEE Transactions on Knowledge and Data Engineering |
Keywords | DocType | Volume |
Manifolds,Image reconstruction,Kernel,Adaptation models,Data models,Data mining,Principal component analysis | Journal | 32 |
Issue | ISSN | Citations |
5 | 1041-4347 | 7 |
PageRank | References | Authors |
0.41 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhao Zhang | 1 | 938 | 65.99 |
| Yan Zhang | 2 | 9 | 1.10 |
| Guangcan Liu | 3 | 2515 | 76.85 |
| Jinhui Tang | 4 | 5180 | 212.18 |
| Shuicheng Yan | 5 | 162 | 10.26 |
| Meng Wang | 6 | 3094 | 167.38 |