DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization
Graph clustering is a fundamental and challenging task in the field of graph mining where the objective is to group the nodes into clusters taking into consideration the topology of the graph. It has several applications in diverse domains spanning social network analysis, recommender systems, computer vision, and bioinformatics. In this work, we propose a novel method, DGCluster, which primarily optimizes the modularity objective using graph neural networks and scales linearly with the graph size. Our method does not require the number of clusters to be specified as a part of the input and can also leverage the availability of auxiliary node level information. We extensively test DGCluster on several real-world datasets of varying sizes, across multiple popular cluster quality metrics. Our approach consistently outperforms the state-of-the-art methods, demonstrating significant performance gains in almost all settings.
Code (1)
Tasks
ClusteringGraph ClusteringGraph MiningRecommendation SystemsSimilar Papers 제목 키워드 기반
Modularity aided consistent attributed graph clustering via coarsening
Graph clustering is an important unsupervised learning technique for partitioning graphs with attributes and detecting communities. However, current methods struggle to accurately capture true community structures and in…
ClusteringGraph ClusteringStochastic Block ModelRevisiting Modularity Maximization for Graph Clustering: A Contrastive Learning Perspective
Graph clustering, a fundamental and challenging task in graph mining, aims to classify nodes in a graph into several disjoint clusters. In recent years, graph contrastive learning (GCL) has emerged as a dominant line of …
ClusteringCommunity DetectionContrastive LearningGraph Clustering+1Unsupervised Optimisation of GNNs for Node Clustering
Graph Neural Networks (GNNs) can be trained to detect communities within a graph by learning from the duality of feature and connectivity information. Currently, the common approach for optimisation of GNNs is to use com…
Clusteringgraph partitioningModel SelectionNode ClusteringAxioms for graph clustering quality functions
We investigate properties that intuitively ought to be satisfied by graph clustering quality functions, that is, functions that assign a score to a clustering of a graph. Graph clustering, also known as network community…
ClusteringCommunity DetectionGraph ClusteringSpectral Subspace Clustering for Attributed Graphs
Subspace clustering seeks to identify subspaces that segment a set of n data points into k (k<<n) groups, which has emerged as a powerful tool for analyzing data from various domains, especially images and videos. Recent…
AttributeClustering