Deep Clustering via Gradual Community Detection
Tianyu Cheng, Qun Chen

TL;DR
This paper introduces a novel deep clustering method called gradual community detection, which improves clustering performance by leveraging global structural characteristics through community merging, enhancing pseudo-label purity and self-supervision.
Contribution
It proposes a new clustering strategy that combines community detection with gradual cluster expansion, integrating network analysis into deep clustering to improve accuracy.
Findings
Achieves state-of-the-art performance on benchmark datasets.
Effectively improves community pseudo-label purity.
Enhances self-supervision through global structural analysis.
Abstract
Deep clustering is an essential task in modern artificial intelligence, aiming to partition a set of data samples into a given number of homogeneous groups (i.e., clusters). Recent studies have proposed increasingly advanced deep neural networks and training strategies for deep clustering, effectively improving performance. However, deep clustering generally remains challenging due to the inadequacy of supervision signals. Building upon the existing representation learning backbones, this paper proposes a novel clustering strategy of gradual community detection. It initializes clustering by partitioning samples into many pseudo-communities and then gradually expands clusters by community merging. Compared with the existing clustering strategies, community detection factors in the new perspective of cluster network analysis in the clustering process. The new perspective can effectively…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Advanced Clustering Algorithms Research
MethodsSparse Evolutionary Training
