Deep Graph Clustering via Mutual Information Maximization and Mixture Model

05/10/2022
by   Maedeh Ahmadi, et al.
0

Attributed graph clustering or community detection which learns to cluster the nodes of a graph is a challenging task in graph analysis. In this paper, we introduce a contrastive learning framework for learning clustering-friendly node embedding. Although graph contrastive learning has shown outstanding performance in self-supervised graph learning, using it for graph clustering is not well explored. We propose Gaussian mixture information maximization (GMIM) which utilizes a mutual information maximization approach for node embedding. Meanwhile, it assumes that the representation space follows a Mixture of Gaussians (MoG) distribution. The clustering part of our objective tries to fit a Gaussian distribution to each community. The node embedding is jointly optimized with the parameters of MoG in a unified framework. Experiments on real-world datasets demonstrate the effectiveness of our method in community detection.

READ FULL TEXT
research
04/15/2021

Variational Co-embedding Learning for Attributed Network Clustering

Recent works for attributed network clustering utilize graph convolution...
research
08/15/2023

MOLE: MOdular Learning FramEwork via Mutual Information Maximization

This paper is to introduce an asynchronous and local learning framework ...
research
10/15/2021

Self-supervised Contrastive Attributed Graph Clustering

Attributed graph clustering, which learns node representation from node ...
research
09/14/2017

Revisiting Spectral Graph Clustering with Generative Community Models

The methodology of community detection can be divided into two principle...
research
03/30/2021

Multilayer Graph Clustering with Optimized Node Embedding

We are interested in multilayer graph clustering, which aims at dividing...
research
06/16/2022

Dual Contrastive Attributed Graph Clustering Network

Attributed graph clustering is one of the most important tasks in graph ...
research
05/31/2022

COIN: Co-Cluster Infomax for Bipartite Graphs

Bipartite graphs are powerful data structures to model interactions betw...

Please sign up or login with your details

Forgot password? Click here to reset