DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization

3Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Bhowmick, A., Kosan, M., Huang, Z., Singh, A., & Medya, S. (2024). DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 38, pp. 11069–11077). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v38i10.28983

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free