most citedEvery Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clustering

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.LG2024★ 2 cited

Every Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clustering

Pengfei Zhu, Qian Wang, Yu Wang +2

Attributed graph clustering is an unsupervised task that partitions nodes into different groups. Self-supervised learning (SSL) shows great potential in handling this task, and som…