Discriminative Label Relaxed Regression with Adaptive Graph Learning
The traditional label relaxation regression (LRR) algorithm directly fits the original data without considering the local structure information of the data. While the label relaxation regression algorithm of graph regularization takes into account the local geometric information, the performance of...
Main Authors: | Jingjing Wang, Zhonghua Liu, Wenpeng Lu, Kaibing Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Computational Intelligence and Neuroscience |
Online Access: | http://dx.doi.org/10.1155/2020/8852137 |
Similar Items
-
Dynamic Graph Regularization and Label Relaxation-Based Sparse Matrix Regression for Two-Dimensional Feature Selection
by: Xiuhong Chen, et al.
Published: (2020-01-01) -
Adaptive Graph Regularization Discriminant Nonnegative Matrix Factorization for Data Representation
by: Lin Zhang, et al.
Published: (2019-01-01) -
Semi-Supervised Ridge Regression with Adaptive Graph-Based Label Propagation
by: Yugen Yi, et al.
Published: (2018-12-01) -
Vertex-Relaxed Graceful Labelings of Graphs and Congruences
by: Aftene, Florin
Published: (2018) -
Discriminative Adaptive Sets for Multi-Label Classification
by: Muhammad Usman Ghani, et al.
Published: (2020-01-01)