$\texttt{SynC}$: Synergistic Boosting of Structure and Representation for Deep Graph Clustering
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911691118215168 |
|---|---|
| author | Ding, Shifei Wu, Benyu Xu, Xiao Ding, Ling Wu, Xindong |
| author_facet | Ding, Shifei Wu, Benyu Xu, Xiao Ding, Ling Wu, Xindong |
| contents | Employing graph neural networks (GNNs) for graph clustering has shown promising results in deep graph clustering. However, existing methods disregard the reciprocal relationship between representation learning and structure augmentation: the more homogeneous the graph, the more cohesive the node representations; the more cohesive the node representations, the more reliable the structure augmentation becomes. Moreover, the generalization ability of existing GNN-based models on the low homophily graph is relatively poor. To this end, we propose a graph clustering framework named Synergistic Deep Graph Clustering Network (SynC). SynC employs a Transform Input Graph Auto-Encoder (TIGAE) to obtain high-quality embeddings via mitigating the representations collapse issue of GAE for guiding structure augmentation. Then, we re-capture neighborhood representations on the refined graph to obtain clustering-friendly embeddings and conduct self-supervised clustering. Notably, these two stages share weights, resulting in synergistic boosting while significantly reducing the number of model parameters. Additionally, we introduce a structure fine-tuning strategy to improve the model's generalization on the low homophily graph. Extensive experiments on benchmark datasets demonstrate the superiority of SynC. The code is released at GitHub. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_15797 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | $\texttt{SynC}$: Synergistic Boosting of Structure and Representation for Deep Graph Clustering Ding, Shifei Wu, Benyu Xu, Xiao Ding, Ling Wu, Xindong Machine Learning Artificial Intelligence Employing graph neural networks (GNNs) for graph clustering has shown promising results in deep graph clustering. However, existing methods disregard the reciprocal relationship between representation learning and structure augmentation: the more homogeneous the graph, the more cohesive the node representations; the more cohesive the node representations, the more reliable the structure augmentation becomes. Moreover, the generalization ability of existing GNN-based models on the low homophily graph is relatively poor. To this end, we propose a graph clustering framework named Synergistic Deep Graph Clustering Network (SynC). SynC employs a Transform Input Graph Auto-Encoder (TIGAE) to obtain high-quality embeddings via mitigating the representations collapse issue of GAE for guiding structure augmentation. Then, we re-capture neighborhood representations on the refined graph to obtain clustering-friendly embeddings and conduct self-supervised clustering. Notably, these two stages share weights, resulting in synergistic boosting while significantly reducing the number of model parameters. Additionally, we introduce a structure fine-tuning strategy to improve the model's generalization on the low homophily graph. Extensive experiments on benchmark datasets demonstrate the superiority of SynC. The code is released at GitHub. |
| title | $\texttt{SynC}$: Synergistic Boosting of Structure and Representation for Deep Graph Clustering |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2406.15797 |