Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 6068-6079· 0 citations· 41 references
TL;DR
RGIGC formulates receptive field configuration as a structural reasoning problem and employs reinforcement learning with two Q-learning agents to infer and optimize the structural receptive field of each node to enhance the interpretability of the resulting clusters.
Abstract
Graph clustering aims to group nodes into meaningful clusters, a crucial task for understanding the behavior of complex networks and their underlying structural organization. Leveraging the expressive power of deep learning, graph neural networks (GNNs) have emerged as popular tools for performing graph clustering with high accuracy. However, despite their promise, existing GNN-based approaches often lack structural reasoning mechanisms to adaptively infer and optimize each node's receptive field in a task-specific manner, limiting their potential to further improve both accuracy and interpretability. In this paper, we propose a novel reinforced structural reasoning framework, termed RGIGC, for interpretable graph clustering. RGIGC formulates receptive field configuration as a structural reasoning problem and employs reinforcement learning with two Q-learning agents to infer and optimize the structural receptive field of each node. These agents are guided by reward criteria that strategically shape the clustering process to achieve desired outcomes. By identifying critical structures of receptive fields that capture the intrinsic features of nodes, RGIGC can enhance the interpretability of the resulting clusters. Extensive experiments on eight real-world graph datasets of varying scales have been conducted, and the results demonstrate that RGIGC outperforms state-of-the-art graph clustering algorithms in both accuracy and interpretability.
This work proposes a novel Adaptive Dual-level Collaborative GNN associated with an adaptive dual-level collaborative mechanism, and shows that the ADC-GNN can inject the learned high-level information back into the node level, forming a closed-loop, bidirectional optimization process.
Wan Tang, Lu Bai, Li-Xin Cui et al.· Proceedings of the Thirty-Fi...· 0 citations
This work uses Graph Neural Networks (GNNs) to solve Inductive Correlation Clustering, a novel generalization of the CC problem designed to handle unseen graph instances, and indicates that the method serves as an efficient pooling layer, enhancing the ability of GNNs to capture hierarchical structural information in n...
Francesco Paolo Nerini, Francesco Bonchi, Arijit Khan et al.· 0 citations
This paper proposes Curriculum-GraphLLM, a novel graphLLM framework for joint optimization of architectures, structures, and texts for denoised graph neural architecture search to jointly optimize GNN architectures, graph structures, and textual semantics as a unified denoising process during architecture search.
Xin Wang, Haibo Chen, Linxin Xiao et al.· IEEE Transactions on Pattern...· 0 citations
This systematic review presents a comprehensive analysis of graph neural networks (GNNs), focusing on their major types and applications. GNNs have emerged as an effective deep learning (DL) method for modelling and analysing intricate relationships in graph‐structured data. Their versatility has led to widespread ad...
Graph neural networks have shown strong potential for learning structural representations of biological networks. However, repeated message passing may blur local structural signals that are relevant for motif- and graphlet-based analysis. This paper investigates multilabel graphlet classification in protein–protein in...
Lidija Kunst, Friedhelm Schwenker, H. Kestler· Entropy· 0 citations
HARMONIA achieves stronger explanation recovery than existing interpretable graph baselines while maintaining competitive predictive performance and scaling to graphs with millions of nodes, and shows that interpretable graph learning can remain both faithful and scalable without sacrificing predictive effectiveness.
Q. D. Bùi, D. Nguyen, A. Dang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.