Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 6068-6079· 0 citations· 23 references
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
GraphAgent is demonstrated, a user-friendly and effective system for knowledge-guided selection of Graph Neural Network models for new graph data that unifies over 413,000 performance records from public GNN benchmarks into a comprehensive Graph-Model Knowledge Graph (GMKG).
Ming-Tao Zhang, Hao-Yang Li, Yu-Ming Xu et al.· Proceedings of the VLDB Endo...· 0 citations
The proposed AFGNN model dynamically regulates the fusion of view-specific embeddings, enhances reasoning capability, and suppresses uncertainty during representation learning, and demonstrates the effectiveness and superiority of AFGNN compared with state-of-the-art GNN-based link prediction models.
Phu Pham· International Journal of Unc...· 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
Similarity-guided Structural Matching Learning for Graph Dataset Condensation (SSGDC) is proposed, which efficiently reduces repository size while maintaining both task performance and structural information.
Yi-Yang Zhang, Yutong Ye, Ying-Bo Zhou et al.· Proceedings of the Thirty-Fi...· 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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.