Improved Algorithm Based on Non-negative Low Rank and Sparse Graph for Semi-supervised Learning
- Publication Type:
- Journal Article
- Citation:
- Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2017, 39 (4), pp. 915 - 921
- Issue Date:
- 2017-04-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 一种基于非负低秩稀疏图的半监督学习改进算法.pdf | Published Version | 2.66 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2017, Science Press. All right reserved. Semi-supervised learning algorithm based on non-negative low rank and sparse graph can not describe the structures of the data exactly. Therefore, an improved algorithm which integrates smoothed low rank representation and weighted sparsity constraint is proposed. The low rank term and sparse term of the classical algorithm are improved by this algorithm respectively, and the global subspace structure and the locally linear structure can be captured exactly. When building the objective function, the logarithm determinant function instead of the nuclear norm is used to approximate the rank function smoothly. Meanwhile, the shape interaction information and the label information of labeled samples is used to build the weighted sparsity constraint regularization term. Then, the objective function is solved by a linearized alternating direction method with adaptive penalty and the graph construction is restructured by an available post-processing method. Finally, a semi-supervised classification framework based on local and global consistency is used to finish the learning task. The experimental results on ORL, Extended Yale B and USPS database show that the improved algorithm improves the accuracy of semi-supervised learning.
Please use this identifier to cite or link to this item: