Hard Sample Aware Network for Contrastive Deep Graph Clustering

by   Yue Liu, et al.
National University of Defense Technology

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 mining-based algorithms have achieved great attention for their promising performance. However, we find that the existing hard sample mining methods have two problems as follows. 1) In the hardness measurement, the important structural information is overlooked for similarity calculation, degrading the representativeness of the selected hard negative samples. 2) Previous works merely focus on the hard negative sample pairs while neglecting the hard positive sample pairs. Nevertheless, samples within the same cluster but with low similarity should also be carefully learned. To solve the problems, we propose a novel contrastive deep graph clustering method dubbed Hard Sample Aware Network (HSAN) by introducing a comprehensive similarity measure criterion and a general dynamic sample weighing strategy. Concretely, in our algorithm, the similarities between samples are calculated by considering both the attribute embeddings and the structure embeddings, better revealing sample relationships and assisting hardness measurement. Moreover, under the guidance of the carefully collected high-confidence clustering information, our proposed weight modulating function will first recognize the positive and negative samples and then dynamically up-weight the hard sample pairs while down-weighting the easy ones. In this way, our method can mine not only the hard negative samples but also the hard positive sample, thus improving the discriminative capability of the samples further. Extensive experiments and analyses demonstrate the superiority and effectiveness of our proposed method.


Cluster-guided Contrastive Graph Clustering Network

Benefiting from the intrinsic supervision information exploitation capab...

Generating Counterfactual Hard Negative Samples for Graph Contrastive Learning

Graph contrastive learning has emerged as a powerful tool for unsupervis...

Meta-Mining Discriminative Samples for Kinship Verification

Kinship verification aims to find out whether there is a kin relation fo...

Structure-Aware Hard Negative Mining for Heterogeneous Graph Contrastive Learning

Recently, heterogeneous Graph Neural Networks (GNNs) have become a de fa...

Model-Aware Contrastive Learning: Towards Escaping Uniformity-Tolerance Dilemma in Training

Instance discrimination contrastive learning (CL) has achieved significa...

Neighborhood Contrastive Learning for Scientific Document Representations with Citation Embeddings

Learning scientific document representations can be substantially improv...

Neighborhood-based Hard Negative Mining for Sequential Recommendation

Negative sampling plays a crucial role in training successful sequential...

Code Repositories


[AAAI 2023] An official source code for paper Hard Sample Aware Network for Contrastive Deep Graph Clustering.

view repo

Please sign up or login with your details

Forgot password? Click here to reset