pith. sign in

arxiv: 2211.12875 · v4 · pith:VJQMW3MKnew · submitted 2022-11-23 · 💻 cs.LG · cs.AI

A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource

classification 💻 cs.LG cs.AI
keywords graphclusteringdeepmethodsincludingfieldsurveycapability
0
0 comments X
read the original abstract

Graph clustering, which aims to divide nodes in the graph into several distinct clusters, is a fundamental yet challenging task. Benefiting from the powerful representation capability of deep learning, deep graph clustering methods have achieved great success in recent years. However, the corresponding survey paper is relatively scarce, and it is imminent to make a summary of this field. From this motivation, we conduct a comprehensive survey of deep graph clustering. Firstly, we introduce formulaic definition, evaluation, and development in this field. Secondly, the taxonomy of deep graph clustering methods is presented based on four different criteria, including graph type, network architecture, learning paradigm, and clustering method. Thirdly, we carefully analyze the existing methods via extensive experiments and summarize the challenges and opportunities from five perspectives, including graph data quality, stability, scalability, discriminative capability, and unknown cluster number. Besides, the applications of deep graph clustering methods in six domains, including computer vision, natural language processing, recommendation systems, social network analyses, bioinformatics, and medical science, are presented. Last but not least, this paper provides open resource supports, including 1) a collection (\url{https://github.com/yueliu1999/Awesome-Deep-Graph-Clustering}) of state-of-the-art deep graph clustering methods (papers, codes, and datasets) and 2) a unified framework (\url{https://github.com/Marigoldwu/A-Unified-Framework-for-Deep-Attribute-Graph-Clustering}) of deep graph clustering. We hope this work can serve as a quick guide and help researchers overcome challenges in this vibrant field.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Robustness of Graph Self-Supervised Learning to Real-World Noise: A Case Study on Text-Driven Biomedical Graphs

    cs.LG 2026-05 unverdicted novelty 7.0

    Feature reconstruction in GSSL is robust to noise in text-driven biomedical graphs while relation reconstruction is sensitive, with bidirectional GNN architectures performing better on noisy data and yielding up to 7%...

  2. Bridge the Gaps: Heterogeneous Attributed Graph Clustering via Quaternion Representation Learning

    cs.LG 2026-06 unverdicted novelty 6.0

    AGREE is an end-to-end framework for heterogeneous attributed graph clustering that uses quaternion representations, multi-level alignment, and shallow architectures to mitigate over-smoothing and over-dominating effe...

  3. A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks

    cs.LG 2026-05 unverdicted novelty 6.0

    A dual-purpose benchmark supplies two text-derived knowledge graphs and one expert reference graph on the same biomedical corpus to jointly measure construction method quality and GNN robustness via semi-supervised no...

  4. Community detection robustness of graph neural networks

    cs.SI 2025-09 unverdicted novelty 5.0

    Supervised GNNs show higher baseline accuracy on community detection while unsupervised ones like DMoN prove more resilient to attribute shifts, edge deletions, and adversarial perturbations, with stronger communities...