TL;DR
RDSA is a novel deep graph clustering framework that enhances robustness and scalability by integrating dual soft assignment modules, effectively handling noisy real-world graphs and outperforming existing methods.
Contribution
The paper introduces RDSA, a new deep graph clustering framework with dual soft assignment modules that improve robustness, scalability, and performance on noisy datasets.
Findings
RDSA outperforms state-of-the-art methods on various real-world datasets.
RDSA demonstrates high robustness to noisy edges in graph data.
The framework scales effectively to large datasets.
Abstract
Graph clustering is an essential aspect of network analysis that involves grouping nodes into separate clusters. Recent developments in deep learning have resulted in graph clustering, which has proven effective in many applications. Nonetheless, these methods often encounter difficulties when dealing with real-world graphs, particularly in the presence of noisy edges. Additionally, many denoising graph clustering methods tend to suffer from lower performance, training instability, and challenges in scaling to large datasets compared to non-denoised models. To tackle these issues, we introduce a new framework called the Robust Deep Graph Clustering Framework via Dual Soft Assignment (RDSA). RDSA consists of three key components: (i) a node embedding module that effectively integrates the graph's topological features and node attributes; (ii) a structure-based soft assignment module that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
