DisenSemi: Semi-supervised Graph Classification via Disentangled Representation Learning

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Wang, Yifan, Luo, Xiao, Chen, Chong, Hua, Xian-Sheng, Zhang, Ming, Ju, Wei
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909282304262144
author Wang, Yifan
Luo, Xiao
Chen, Chong
Hua, Xian-Sheng
Zhang, Ming
Ju, Wei
author_facet Wang, Yifan
Luo, Xiao
Chen, Chong
Hua, Xian-Sheng
Zhang, Ming
Ju, Wei
contents Graph classification is a critical task in numerous multimedia applications, where graphs are employed to represent diverse types of multimedia data, including images, videos, and social networks. Nevertheless, in real-world scenarios, labeled graph data can be limited or scarce. To address this issue, we focus on the problem of semi-supervised graph classification, which involves both supervised and unsupervised models learning from labeled and unlabeled data. In contrast to recent approaches that transfer the entire knowledge from the unsupervised model to the supervised one, we argue that an effective transfer should only retain the relevant semantics that align well with the supervised task. In this paper, we propose a novel framework named DisenSemi, which learns disentangled representation for semi-supervised graph classification. Specifically, a disentangled graph encoder is proposed to generate factor-wise graph representations for both supervised and unsupervised models. Then we train two models via supervised objective and mutual information (MI)-based constraints respectively. To ensure the meaningful transfer of knowledge from the unsupervised encoder to the supervised one, we further define an MI-based disentangled consistency regularization between two models and identify the corresponding rationale that aligns well with the current graph classification task. Experimental results on a range of publicly accessible datasets reveal the effectiveness of our DisenSemi.
format Preprint
id arxiv_https___arxiv_org_abs_2407_14081
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle DisenSemi: Semi-supervised Graph Classification via Disentangled Representation Learning
Wang, Yifan
Luo, Xiao
Chen, Chong
Hua, Xian-Sheng
Zhang, Ming
Ju, Wei
Machine Learning
Artificial Intelligence
Information Retrieval
Social and Information Networks
Graph classification is a critical task in numerous multimedia applications, where graphs are employed to represent diverse types of multimedia data, including images, videos, and social networks. Nevertheless, in real-world scenarios, labeled graph data can be limited or scarce. To address this issue, we focus on the problem of semi-supervised graph classification, which involves both supervised and unsupervised models learning from labeled and unlabeled data. In contrast to recent approaches that transfer the entire knowledge from the unsupervised model to the supervised one, we argue that an effective transfer should only retain the relevant semantics that align well with the supervised task. In this paper, we propose a novel framework named DisenSemi, which learns disentangled representation for semi-supervised graph classification. Specifically, a disentangled graph encoder is proposed to generate factor-wise graph representations for both supervised and unsupervised models. Then we train two models via supervised objective and mutual information (MI)-based constraints respectively. To ensure the meaningful transfer of knowledge from the unsupervised encoder to the supervised one, we further define an MI-based disentangled consistency regularization between two models and identify the corresponding rationale that aligns well with the current graph classification task. Experimental results on a range of publicly accessible datasets reveal the effectiveness of our DisenSemi.
title DisenSemi: Semi-supervised Graph Classification via Disentangled Representation Learning
topic Machine Learning
Artificial Intelligence
Information Retrieval
Social and Information Networks
url https://arxiv.org/abs/2407.14081