Linear projection fused graph-based semi-supervised learning on multi-view data

Abstract In recent years, the surge in data-driven applications across various domains has spurred heightened interest in semi-supervised learning applied to graphs. This surge is attributed to the ubiquitous presence of graph data structures in real-world contexts, such as social networks’ interpersonal relationships, recommender systems’ user behavior graphs, and bioinformatics’ molecular interaction networks. However, for certain data types like images, not only is there a dearth of explicit graph structure, but also the existence of multiple view description methods complicates matters further. The intricacies of multi-view data pose challenges in directly applying traditional semi-supervised learning techniques to graphs. Consequently, researchers have begun exploring the fusion of semi-supervised learning with deep learning to leverage its wealth of information and enhance model efficacy. Effectively amalgamating graph structures with multi-view data remains a challenging problem necessitating further research. This paper introduces the Linear projection Fused Graph-based Semi-supervised Classification (LFGSC) method tailored for multi-view data, building upon the Graph Convolutional Network (GCN) architecture. Firstly, for each view, we leverage a semi-supervised approach that provides the concurrent estimation of the corresponding graph and the flexible linear data representations in a low-dimensional feature space. Subsequently, an adaptive and unified graph is generated, followed by the utilization of a fully connected network to fuse the projected features further and reduce dimensionality. Finally, the fused features and graph are inputted into a GCN to conduct semi-supervised classification. During training, the model incorporates cross-entropy loss, manifold regularization loss, graph auto-encoder loss, and supervised contrastive loss. Leveraging linear transformation significantly diminishes the input feature dimensions for GCN, thereby achieving high accuracy while substantially reducing computational overhead. Furthermore, experimental results conducted on various bench-marked multi-view image datasets demonstrate the superiority of LFGSC over existing semi-supervised learning methods for multi-view scenarios. (Source code: https://github.com/BiJingjun/LFGSC. )

Authors

Institutions

Publication Details

Journal
Artificial Intelligence Review
Published
2025-07-12
DOI
https://doi.org/10.1007/s10462-025-11313-8
Citations
1
Primary Topic
Video Surveillance and Tracking Methods
Type
article
Field-Weighted Citation Impact
1.28

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Linear projection fused graph-based semi-supervised learning on multi-view data

Jinan Charafeddine, Jingjun Bi, Fadi Dornaika
1 citations
Artificial Intelligence Review
Video Surveillance and Tracking Methods
1.28
article

Linear projection fused graph-based semi-supervised learning on multi-view data

Jinan Charafeddine, Jingjun Bi, Fadi Dornaika
article en
1 citations

Abstract

Abstract In recent years, the surge in data-driven applications across various domains has spurred heightened interest in semi-supervised learning applied to graphs. This surge is attributed to the ubiquitous presence of graph data structures in real-world contexts, such as social networks’ interpersonal relationships, recommender systems’ user behavior graphs, and bioinformatics’ molecular interaction networks. However, for certain data types like images, not only is there a dearth of explicit graph structure, but also the existence of multiple view description methods complicates matters further. The intricacies of multi-view data pose challenges in directly applying traditional semi-supervised learning techniques to graphs. Consequently, researchers have begun exploring the fusion of semi-supervised learning with deep learning to leverage its wealth of information and enhance model efficacy. Effectively amalgamating graph structures with multi-view data remains a challenging problem necessitating further research. This paper introduces the Linear projection Fused Graph-based Semi-supervised Classification (LFGSC) method tailored for multi-view data, building upon the Graph Convolutional Network (GCN) architecture. Firstly, for each view, we leverage a semi-supervised approach that provides the concurrent estimation of the corresponding graph and the flexible linear data representations in a low-dimensional feature space. Subsequently, an adaptive and unified graph is generated, followed by the utilization of a fully connected network to fuse the projected features further and reduce dimensionality. Finally, the fused features and graph are inputted into a GCN to conduct semi-supervised classification. During training, the model incorporates cross-entropy loss, manifold regularization loss, graph auto-encoder loss, and supervised contrastive loss. Leveraging linear transformation significantly diminishes the input feature dimensions for GCN, thereby achieving high accuracy while substantially reducing computational overhead. Furthermore, experimental results conducted on various bench-marked multi-view image datasets demonstrate the superiority of LFGSC over existing semi-supervised learning methods for multi-view scenarios. (Source code: https://github.com/BiJingjun/LFGSC. )

Artificial Intelligence ReviewVol. 58(10)
Ikerbasque (ES), University of the Basque Country (ES), North China University of Water Resources and Electric Power (CN), Basque Culinary Center (ES), Vinci (France) (FR), Material Physics Center (ES)
Euskal Herriko Unibertsitatea
Openalex Percentile: Top 18%
Video Surveillance and Tracking Methods
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.