TY - GEN
T1 - A Semi-supervised Classification Using Gated Linear Model
AU - Ren, Yanni
AU - Li, Weite
AU - Hu, Jinglu
PY - 2019/7
Y1 - 2019/7
N2 - Semi-supervised learning aims to construct a classifier by making use of both labeled data and unlabeled data. This paper proposes a semi-supervised classification method using a gated linear model, based on the idea of effectively utilizing manifold information. A gating mechanism is firstly trained in a semi-supervised manner to capture manifold information which guides the generation of gate signals. Then the gated linear model is formulated into a linear regression form with the gate signals included. Secondly, a Laplacian regularized least squares (LapRLS) formulation is applied to optimize the linear regression form of the gated linear model. In this way, the gate signals are integrated into the kernel function, which is defined as inner product of the regression vectors. Moreover, this kernel function is used as a better similarity function for graph construction. As a result, the manifold information is ingeniously incorporated into both kernel and graph Laplacian in the LapRLS. Experimental results exhibit the effectiveness of our proposed method.
AB - Semi-supervised learning aims to construct a classifier by making use of both labeled data and unlabeled data. This paper proposes a semi-supervised classification method using a gated linear model, based on the idea of effectively utilizing manifold information. A gating mechanism is firstly trained in a semi-supervised manner to capture manifold information which guides the generation of gate signals. Then the gated linear model is formulated into a linear regression form with the gate signals included. Secondly, a Laplacian regularized least squares (LapRLS) formulation is applied to optimize the linear regression form of the gated linear model. In this way, the gate signals are integrated into the kernel function, which is defined as inner product of the regression vectors. Moreover, this kernel function is used as a better similarity function for graph construction. As a result, the manifold information is ingeniously incorporated into both kernel and graph Laplacian in the LapRLS. Experimental results exhibit the effectiveness of our proposed method.
KW - graph construction
KW - kernel composition
KW - Laplacian RLS
KW - semi-supervised learning
UR - http://www.scopus.com/inward/record.url?scp=85073239138&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85073239138&partnerID=8YFLogxK
U2 - 10.1109/IJCNN.2019.8852099
DO - 10.1109/IJCNN.2019.8852099
M3 - Conference contribution
AN - SCOPUS:85073239138
T3 - Proceedings of the International Joint Conference on Neural Networks
BT - 2019 International Joint Conference on Neural Networks, IJCNN 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 International Joint Conference on Neural Networks, IJCNN 2019
Y2 - 14 July 2019 through 19 July 2019
ER -