paper-with-me

Papers

Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration

2025-02-03 · Jianming Huang, Hiroyuki Kasai

Graph data, with its structurally variable nature, represents complex real-world phenomena like chemical compounds, protein structures, and social networks. Traditional Graph Neural Networks (GNNs) primarily utilize the message-passing mechanism, but their expressive power is limited and their prediction lacks explainability. To address these limitations, researchers have focused on graph substructures. Subgraph neural networks (SGNNs) and GNN explainers have emerged as potential solutions, but each has its limitations. SGNNs computes graph representations based on the bags of subgraphs to enhance the expressive power. However, they often rely on predefined algorithm-based sampling strategies, which is inefficient. GNN explainers adopt data-driven approaches to generate important subgraphs to provide explanation. Nevertheless, their explanation is difficult to be translated into practical improvements on GNNs. To overcome these issues, we propose a novel self-supervised framework that integrates SGNNs with the generation approach of GNN explainers, named the Reinforcement Walk Exploration SGNN (RWE-SGNN). Our approach features a sampling model trained in an explainer fashion, optimizing subgraphs to enhance model performance. To achieve a data-driven sampling approach, unlike traditional subgraph generation approaches, we propose a novel walk exploration process, which efficiently extracts important substructures, simplifying the embedding process and avoiding isomorphism problems. Moreover, we prove that our proposed walk exploration process has equivalent generation capability to the traditional subgraph generation process. Experimental results on various graph datasets validate the effectiveness of our proposed method, demonstrating significant improvements in performance and precision.

📄 PDF Abstract BibTeX arXiv:2502.01809

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

ADOPT Please enter a description about the method here

Similar Papers 제목 키워드 기반

SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanism

2021-01-20 · Qingyun Sun, JianXin Li, Hao Peng, Jia Wu 외

Graph representation learning has attracted increasing research attention. However, most existing studies fuse all structural features and node attributes to provide an overarching view of graphs, neglecting finer substr…

Graph ClassificationGraph Neural NetworkGraph Representation LearningRepresentation Learning

Ripple Walk Training: A Subgraph-based training framework for Large and Deep Graph Neural Network

2020-02-17 · Jiyang Bai, Yuxiang Ren, Jiawei Zhang

Graph neural networks (GNNs) have achieved outstanding performance in learning graph-structured data and various tasks. However, many current GNNs suffer from three common problems when facing large-size graphs or using …

AttributeGraph Neural Network

Intrinsically motivated graph exploration using network theories of human curiosity

2023-07-11 · Shubhankar P. Patankar, Mathieu Ouellet, Juan Cervino, Alejandro Ribeiro 외

Intrinsically motivated exploration has proven useful for reinforcement learning, even without additional extrinsic rewards. When the environment is naturally represented as a graph, how to guide exploration best remains…

Graph Neural NetworkRecommendation Systemsreinforcement-learningReinforcement Learning

Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis

2007-12-01 · NeurIPS 2007 12 · Venkat Chandrasekaran, Alan S. Willsky, Jason K. Johnson

We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable subgraphs thereby leading to the solutio…

Collaborative Graph Walk for Semi-supervised Multi-Label Node Classification

2019-10-22 · Uchenna Akujuobi, Han Yufei, Qiannan Zhang, Xiangliang Zhang

In this work, we study semi-supervised multi-label node classification problem in attributed graphs. Classic solutions to multi-label node classification follow two steps, first learn node embedding and then build a node…

ClassificationGeneral ClassificationMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATION+2