vix.ing · top · new · best · stats · spec

From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited

2023/09/24 by Zheng Wang, Hongming Ding, Wang, Zheng +9 · 1 citation
Computer Science · Social Sciences · #Advanced Computing and Algorithms #Advanced Graph Neural Networks #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Text and Document Classification Technologies

paper · pdf · doi:10.48550/arxiv.2309.13599

openalex publication_date 2023/09/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Graph-based semi-supervised learning (GSSL) has long been a hot research topic. Traditional methods are generally shallow learners, based on the cluster assumption. Recently, graph convolutional networks (GCNs) have become the predominant techniques for their promising performance. In this paper, we theoretically discuss the relationship between these two types of methods in a unified optimization framework. One of the most intriguing findings is that, unlike traditional ones, typical GCNs may not jointly consider the graph structure and label information at each layer. Motivated by this, we further propose three simple but powerful graph convolution methods. The first is a supervised method OGC which guides the graph convolution process with labels. The others are two unsupervised methods: GGC and its multi-scale version GGCM, both aiming to preserve the graph structure information during the convolution process. Finally, we conduct extensive experiments to show the effectiveness of our methods. Code is available at https://github.com/zhengwang100/ogcggcm.

Cited by

Related