REVIEW 4 cited by
A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 4 Pith papers
-
Revisiting Degree-Corrected Spectral Clustering: a Condition-Free Spectral Analysis and Extension
A condition-free spectral bound ties DCSC's misclustered-node count to degree heterogeneity and cluster weakness, and the new ASCENT variant shows early-stage node-wise corrections can improve clustering.
-
Divide-Then-Rule: A Cluster-Driven Hierarchical Interpolator for Attribute-Missing Graphs
A hierarchical, cluster-aware imputation method (DTRGC) that reweights feature propagation by cluster membership and imputes missing node attributes in stages improves deep graph clustering on attribute-missing graphs.
-
Breaking Structural Isolation: Scalable Graph Clustering via Community-Aware Sampling and Structural Entropy
Constrained structural-entropy communities plus community-aware batch expansion and random-walk contrastive learning beat prior unsupervised graph clustering methods on large graphs.
-
Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation
CMV-ND builds one feature view per exact hop distance and then runs existing clustering methods on those views, improving attribute-missing large-scale graph clustering in experiments.
Discussion (0). Sign in to comment.