Motif-driven Subgraph Structure Learning for Graph Classification

• URL: http://arxiv.org/abs/2406.08897v1
• Date: Thu, 13 Jun 2024 07:50:44 GMT
• Title: Motif-driven Subgraph Structure Learning for Graph Classification
• Authors: Zhiyao Zhou, Sheng Zhou, Bochao Mao, Jiawei Chen, Qingyun Sun, Yan Feng, Chun Chen, Can Wang,
• Abstract summary: Graph Structure Learning (GSL) has emerged as a promising approach to improve graph structure and boost performance in downstream tasks. We propose a novel Motif-driven Subgraph Structure Learning method for Graph Classification (MOSGSL)
• Score: 25.205435425328215
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: To mitigate the suboptimal nature of graph structure, Graph Structure Learning (GSL) has emerged as a promising approach to improve graph structure and boost performance in downstream tasks. Despite the proposal of numerous GSL methods, the progresses in this field mostly concentrated on node-level tasks, while graph-level tasks (e.g., graph classification) remain largely unexplored. Notably, applying node-level GSL to graph classification is non-trivial due to the lack of find-grained guidance for intricate structure learning. Inspired by the vital role of subgraph in graph classification, in this paper we explore the potential of subgraph structure learning for graph classification by tackling the challenges of key subgraph selection and structure optimization. We propose a novel Motif-driven Subgraph Structure Learning method for Graph Classification (MOSGSL). Specifically, MOSGSL incorporates a subgraph structure learning module which can adaptively select important subgraphs. A motif-driven structure guidance module is further introduced to capture key subgraph-level structural patterns (motifs) and facilitate personalized structure learning. Extensive experiments demonstrate a significant and consistent improvement over baselines, as well as its flexibility and generalizability for various backbones and learning procedures.

Related papers

• Graph Self-Supervised Learning with Learnable Structural and Positional Encodings [39.20899720477907]
  We introduce emphGenHopNet, a GNN framework that integrates a $k$-hop message-passing scheme. We also propose a structural- and positional-aware GSSL framework that incorporates topological information throughout the learning process. Our work significantly advances GSSL's capability in distinguishing graphs with similar local structures but different global topologies.
  arXiv  Detail & Related papers  (2025-02-22T14:10:06Z)
• GaGSL: Global-augmented Graph Structure Learning via Graph Information Bottleneck [5.943641527857957]
  We propose a novel method named textitGlobal-augmented Graph Structure Learning (GaGSL) The key idea behind GaGSL is to learn a compact and informative graph structure for node classification tasks. Comprehensive evaluations across a range of datasets reveal the outstanding performance and robustness of GaGSL compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-11-07T01:23:48Z)
• GraphEdit: Large Language Models for Graph Structure Learning [62.618818029177355]
  Graph Structure Learning (GSL) focuses on capturing intrinsic dependencies and interactions among nodes in graph-structured data. Existing GSL methods heavily depend on explicit graph structural information as supervision signals. We propose GraphEdit, an approach that leverages large language models (LLMs) to learn complex node relationships in graph-structured data.
  arXiv  Detail & Related papers  (2024-02-23T08:29:42Z)
• Homophily-enhanced Structure Learning for Graph Clustering [19.586401211161846]
  Graph structure learning allows refining the input graph by adding missing links and removing spurious connections. Previous endeavors in graph structure learning have predominantly centered around supervised settings. We propose a novel method called textbfhomophily-enhanced structure textbflearning for graph clustering (HoLe)
  arXiv  Detail & Related papers  (2023-08-10T02:53:30Z)
• SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimization [67.28453445927825]
  Graph Neural Networks (GNNs) are de facto solutions to structural data learning. Existing graph structure learning (GSL) frameworks still lack robustness and interpretability. This paper proposes a general GSL framework, SE-GSL, through structural entropy and the graph hierarchy abstracted in the encoding tree.
  arXiv  Detail & Related papers  (2023-03-17T05:20:24Z)
• Spectral Augmentations for Graph Contrastive Learning [50.149996923976836]
  Contrastive learning has emerged as a premier method for learning representations with or without supervision. Recent studies have shown its utility in graph representation learning for pre-training. We propose a set of well-motivated graph transformation operations to provide a bank of candidates when constructing augmentations for a graph contrastive objective.
  arXiv  Detail & Related papers  (2023-02-06T16:26:29Z)
• Structure-Preserving Graph Representation Learning [43.43429108503634]
  We propose a novel Structure-Preserving Graph Representation Learning (SPGRL) method to fully capture the structure information of graphs. Specifically, to reduce the uncertainty and misinformation of the original graph, we construct a feature graph as a complementary view via k-Nearest Neighbor method. Our method has quite superior performance on semi-supervised node classification task and excellent robustness under noise perturbation on graph structure or node features.
  arXiv  Detail & Related papers  (2022-09-02T02:49:19Z)
• Towards Unsupervised Deep Graph Structure Learning [67.58720734177325]
  We propose an unsupervised graph structure learning paradigm, where the learned graph topology is optimized by data itself without any external guidance. Specifically, we generate a learning target from the original data as an "anchor graph", and use a contrastive loss to maximize the agreement between the anchor graph and the learned graph.
  arXiv  Detail & Related papers  (2022-01-17T11:57:29Z)
• Graph Structure Learning with Variational Information Bottleneck [70.62851953251253]
  We propose a novel Variational Information Bottleneck guided Graph Structure Learning framework, namely VIB-GSL. VIB-GSL learns an informative and compressive graph structure to distill the actionable information for specific downstream tasks.
  arXiv  Detail & Related papers  (2021-12-16T14:22:13Z)
• Structure-Enhanced Meta-Learning For Few-Shot Graph Classification [53.54066611743269]
  This work explores the potential of metric-based meta-learning for solving few-shot graph classification. An implementation upon GIN, named SMFGIN, is tested on two datasets, Chembl and TRIANGLES.
  arXiv  Detail & Related papers  (2021-03-05T09:03:03Z)
• Deep Graph Structure Learning for Robust Representations: A Survey [20.564611153151834]
  Graph Neural Networks (GNNs) are widely used for analyzing graph-structured data. To improve the robustness of GNN models, many studies have been proposed around the central concept of Graph Structure Learning.
  arXiv  Detail & Related papers  (2021-03-04T13:49:25Z)
• CommPOOL: An Interpretable Graph Pooling Framework for Hierarchical Graph Representation Learning [74.90535111881358]
  We propose a new interpretable graph pooling framework - CommPOOL. It can capture and preserve the hierarchical community structure of graphs in the graph representation learning process. CommPOOL is a general and flexible framework for hierarchical graph representation learning.
  arXiv  Detail & Related papers  (2020-12-10T21:14:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.