Community detection is a crucial field in graph data mining, gaining attention due to graph neural networks (GNNs). Graph autoencoder network (GAE) has shown potential in unsupervised community detection. However, GAE-based methods are often complex with multiple layers and parameters. They also overlook neighbor node distribution disparities in imbalanced graph data. In an effort to overcome these constraints, we propose a self-supervised graph autoencoder network with node feature convolution (SGAE-NFC) for community detection. SGAE-NFC reduces model complexity through a node feature convolution layer. A self-supervised model optimizes representation learning and community detection, enhancing robustness. Experimental results on real-world datasets demonstrate SGAE-NFC’s superior performance, surpassing existing methods in accuracy and robustness.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Self-supervised Graph Autoencoder with Node Feature Convolution for Community Detection

  • Haoran Tan,
  • Hongkai Xie,
  • Xiaofeng Wang,
  • Jianhao Chen,
  • Qianyi Qian,
  • Haoran Tang

摘要

Community detection is a crucial field in graph data mining, gaining attention due to graph neural networks (GNNs). Graph autoencoder network (GAE) has shown potential in unsupervised community detection. However, GAE-based methods are often complex with multiple layers and parameters. They also overlook neighbor node distribution disparities in imbalanced graph data. In an effort to overcome these constraints, we propose a self-supervised graph autoencoder network with node feature convolution (SGAE-NFC) for community detection. SGAE-NFC reduces model complexity through a node feature convolution layer. A self-supervised model optimizes representation learning and community detection, enhancing robustness. Experimental results on real-world datasets demonstrate SGAE-NFC’s superior performance, surpassing existing methods in accuracy and robustness.