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

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

23 Nov 2022arXiv:2211.12875archive 2025-07-28

Yue Liu, Jun Xia, Sihang Zhou, Xihong Yang, Ke Liang, Chenchen Fan, Yan Zhuang, Stan Z. Li, Xinwang Liu, Kunlun He

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.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2211.12875")

Code

Syntology Ran 0 of 15 code samples harvested from 1 repository linked to this paper; 15 have no recorded run.

By repository: official repository: 15 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering officialmentioned in papermentioned on GitHubpytorchMIT report
yueliu1999/awesome-deep-graph-clustering officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

15 samples harvested; 0 ran; 0 honoured the contract we drafted; 15 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

15unverified

Licence: 0 of the 15 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

aux_objective marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/dgcluster.py official repository unverified MIT (permissive) · 4905baed41d3c5f6 · report
clustering marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/magi.py official repository unverified MIT (permissive) · 4d1191671cba756b · report
comprehensive_similarity marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/hsan.py official repository unverified MIT (permissive) · 67cedfe88192fd2f · report
convert_scipy_torch_sp marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/dgcluster.py official repository unverified MIT (permissive) · 35b4899c9c2538c7 · report
hard_sample_aware_infoNCE marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/hsan.py official repository unverified MIT (permissive) · 47733477ce73f39c · report
init_clustering marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/ccgc.py official repository unverified MIT (permissive) · 22bf7799b5b320ab · report
new_graph marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/agcdrr.py official repository unverified MIT (permissive) · c5b6b75a2ae78c26 · report
normalize marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/agcdrr.py official repository unverified MIT (permissive) · e16f86b431e93340 · report
normalize_adj marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/dcrn.py official repository unverified MIT (permissive) · c4e018bdf71a1f35 · report
numpy_to_torch marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/dcrn.py official repository unverified MIT (permissive) · d860dca965128863 · report
regularization marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/dgcluster.py official repository unverified MIT (permissive) · e82410e993da99a0 · report
remove_edge marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/dcrn.py official repository unverified MIT (permissive) · 1a7f3fbaa1bd6d17 · report
scale marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/magi.py official repository unverified MIT (permissive) · 410bc97745f4b297 · report
square_euclid_distance marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/hsan.py official repository unverified MIT (permissive) · 143d99fb8b6fb704 · report
target_distribution marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/pydgc/models/dfcn.py official repository unverified MIT (permissive) · d9d1d0c203d5cf1b · report

Tasks

AttributeClusteringGraph ClusteringRecommendation Systems

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections