Repository logo
  • Research Outputs
  • Researchers
  • Schools
    Felizberta Lo Padilla Tong School of Social SciencesIp Ying To Lee Yu Yee School of Humanities and LanguagesRita Tong Liu School of Business and Hospitality ManagementS.K. Yee School of Health SciencesYam Pak Charitable Foundation School of Computing and Information Sciences
  • Help
Repository logo
  1. Home
  2. Computing and Information Sciences
  3. CIS Publication
  4. Deep attention-guided graph clustering with dual self-supervision
 
  • Details

Deep attention-guided graph clustering with dual self-supervision

Author(s)
Liu, Hui  
Author(s)
Peng, Z.
Jia, Y.
Hou, J.
Date Issued
2023
Publisher
IEEE
Journal
IEEE Transactions on Circuits and Systems for Video Technology
Volume
33
Issue
7
Start page
3296
End page
3307
Abstract
Existing deep embedding clustering methods fail to sufficiently utilize the available off-the-shelf information from feature embeddings and cluster assignments, limiting their performance. To this end, we propose a novel method, namely deep attention-guided graph clustering with dual self-supervision (DAGC). Specifically, DAGC first utilizes a heterogeneity-wise fusion module to adaptively integrate the features of the auto-encoder and the graph convolutional network in each layer and then uses a scale-wise fusion module to dynamically concatenate the multi-scale features in different layers. Such modules are capable of learning an informative feature embedding via an attention-based mechanism. In addition, we design a distribution-wise fusion module that leverages cluster assignments to acquire clustering results directly. To better explore the off-the-shelf information from the cluster assignments, we develop a dual self-supervision solution consisting of a soft self-supervision strategy with a Kullback-Leibler divergence loss and a hard self-supervision strategy with a pseudo supervision loss. Extensive experiments on nine benchmark datasets validate that our method consistently outperforms state-of-the-art methods. Especially, our method improves the ARI by more than 10.29% over the best baseline.
URI
https://repository.sfu.edu.hk/handle/sfu/4431
DOI
10.1109/TCSVT.2022.3232604
SFU Affiliated Publication
Yes
Availability at SFU Library

No database links found.

Responsible Use of E‑Resources | Privacy Policy | Disclaimer
© SFU Library. All Rights Reserved.
SFU Library