most citedHard Sample Aware Network for Contrastive Deep Graph Clustering

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

collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG202339 cited

Efficient Multi-View Graph Clustering with Local and Global Structure Preservation

Yi Wen, Suyuan Liu, Xinhang Wan +5

Anchor-based multi-view graph clustering (AMVGC) has received abundant attention owing to its high efficiency and the capability to capture complementary structural information acr…

cs.LG202336 cited

Scalable Incomplete Multi-View Clustering with Structure Alignment

Yi Wen, Siwei Wang, Ke Liang +6

The success of existing multi-view clustering (MVC) relies on the assumption that all views are complete. However, samples are usually partially available due to data corruption or…

cs.LG20232 cited

Reinforcement Graph Clustering with Unknown Cluster Number

Yue Liu, Ke Liang, Jun Xia +5

Deep graph clustering, which aims to group nodes into disjoint clusters by neural networks in an unsupervised manner, has attracted great attention in recent years. Although the pe…

cs.LG20232 cited

CONVERT:Contrastive Graph Clustering with Reliable Augmentation

Xihong Yang, Cheng Tan, Yue Liu +7

Contrastive graph node clustering via learnable data augmentation is a hot research spot in the field of unsupervised graph learning. The existing methods learn the sampling distri…

cs.LG20239 cited

Hard Sample Aware Network for Contrastive Deep Graph Clustering

Yue Liu, Xihong Yang, Sihang Zhou +7

Contrastive deep graph clustering, which aims to divide nodes into disjoint groups via contrastive mechanisms, is a challenging research spot. Among the recent works, hard sample m…