Please use this identifier to cite or link to this item:
Title: Learning a nonnegative sparse graph for linear regression
Authors: Fang, X
Xu, Y
Li, X
Lai, Z
Wong, WK 
Keywords: Graph learning
Label propagation
Linear regression
Semi-supervised classification
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on image processing, 2015, v. 24, no. 9, p. 2760-2771 How to cite?
Journal: IEEE transactions on image processing 
Abstract: Previous graph-based semisupervised learning (G-SSL) methods have the following drawbacks: 1) they usually predefine the graph structure and then use it to perform label prediction, which cannot guarantee an overall optimum and 2) they only focus on the label prediction or the graph structure construction but are not competent in handling new samples. To this end, a novel nonnegative sparse graph (NNSG) learning method was first proposed. Then, both the label prediction and projection learning were integrated into linear regression. Finally, the linear regression and graph structure learning were unified within the same framework to overcome these two drawbacks. Therefore, a novel method, named learning a NNSG for linear regression was presented, in which the linear regression and graph learning were simultaneously performed to guarantee an overall optimum. In the learning process, the label information can be accurately propagated via the graph structure so that the linear regression can learn a discriminative projection to better fit sample labels and accurately classify new samples. An effective algorithm was designed to solve the corresponding optimization problem with fast convergence. Furthermore, NNSG provides a unified perceptiveness for a number of graph-based learning methods and linear regression methods. The experimental results showed that NNSG can obtain very high classification accuracy and greatly outperforms conventional G-SSL methods, especially some conventional graph construction methods.
ISSN: 1057-7149
EISSN: 1941-0042
DOI: 10.1109/TIP.2015.2425545
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Nov 8, 2018


Last Week
Last month
Citations as of Nov 17, 2018

Page view(s)

Last Week
Last month
Citations as of Nov 12, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.