TY - JOUR
T1 - Multi-view semi-supervised learning with adaptive graph fusion
AU - Qiang, Qianyao
AU - Zhang, Bin
AU - Nie, Feiping
AU - Wang, Fei
N1 - Publisher Copyright:
© 2023 Elsevier B.V.
PY - 2023/11/7
Y1 - 2023/11/7
N2 - Multi-view Semi-supervised Learning (MSL) is effective in using limited labels and considerable label-free data to improve learning performance. It has been successfully applied to a lot of real scenarios. In this study, we propose a model, termed MSL with Adaptive Graph Fusion (MSLAGF), which provides a novel solution for MSL. Unlike most existing methods propagating label information through the linear combination of pre-built fixed view-based similarity graphs, MSLAGF merges view-based graph construction, graph fusion, and label propagation. It adaptively learns view-specific graphs and automatically assigns weight coefficients to them. A multi-view fusion optimal graph is cleverly learned depending not only on the raw feature space but also on the dynamically predicted label space. Moreover, we present an efficient optimization algorithm to solve the formulated model. The view-specific graphs, the weight coefficients, the optimal graph, and the predicted labels are mutually negotiated and optimized in the optimization procedure. Extensive experimental results on six benchmark datasets validate the superiority.
AB - Multi-view Semi-supervised Learning (MSL) is effective in using limited labels and considerable label-free data to improve learning performance. It has been successfully applied to a lot of real scenarios. In this study, we propose a model, termed MSL with Adaptive Graph Fusion (MSLAGF), which provides a novel solution for MSL. Unlike most existing methods propagating label information through the linear combination of pre-built fixed view-based similarity graphs, MSLAGF merges view-based graph construction, graph fusion, and label propagation. It adaptively learns view-specific graphs and automatically assigns weight coefficients to them. A multi-view fusion optimal graph is cleverly learned depending not only on the raw feature space but also on the dynamically predicted label space. Moreover, we present an efficient optimization algorithm to solve the formulated model. The view-specific graphs, the weight coefficients, the optimal graph, and the predicted labels are mutually negotiated and optimized in the optimization procedure. Extensive experimental results on six benchmark datasets validate the superiority.
KW - Label propagation
KW - Multi-view graph fusion
KW - Multi-view semi-supervised learning
KW - View-specific similarity graph
UR - http://www.scopus.com/inward/record.url?scp=85169621496&partnerID=8YFLogxK
U2 - 10.1016/j.neucom.2023.126685
DO - 10.1016/j.neucom.2023.126685
M3 - 文章
AN - SCOPUS:85169621496
SN - 0925-2312
VL - 557
JO - Neurocomputing
JF - Neurocomputing
M1 - 126685
ER -