Unsupervised Community Detection with Modularity-Based Attention Model
In this paper we take a problem of unsupervised nodes clustering on graphs and show how recent advances in attention models can be applied successfully in a "hard" regime of the problem. We propose an unsupervised algorithm that encodes Bethe Hessian embeddings by optimizing soft modularity loss and argue that our model is competitive to both classical and Graph Neural Network (GNN) models while it can be trained on a single graph.
Code (1)
Tasks
ClusteringCommunity DetectionGraph Neural NetworkmodelMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Recurrent Graph Neural Network Algorithm for Unsupervised Network Community Detection
Network community detection often relies on optimizing partition quality functions, like modularity. This optimization appears to be a complex problem traditionally relying on discrete heuristics. And although the proble…
Community DetectionGraph Neural NetworkVGAER: Graph Neural Network Reconstruction based Community Detection
Community detection is a fundamental and important issue in network science, but there are only a few community detection algorithms based on graph neural networks, among which unsupervised algorithms are almost blank. B…
Community DetectionDecoderGraph Neural NetworkCurvature-Guided Sheaf Diffusion for Unsupervised Community Detection on Heterophilic Graphs
Detecting communities in heterophilic graphs -- where connected nodes often belong to different classes -- is hard for unsupervised methods: classical modularity and spectral methods are feature agnostic, while deep grap…
Community DetectionThe Hyperspherical Geometry of Community Detection: Modularity as a Distance
We introduce a metric space of clusterings, where clusterings are described by a binary vector indexed by the vertex-pairs. We extend this geometry to a hypersphere and prove that maximizing modularity is equivalent to m…
ClusteringCommunity DetectionModularity of the ABCD Random Graph Model with Community Structure
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs with similar prop…
Community Detection