Deep Attention-guided Graph Clustering with Dual Self-supervision

DOI: 10.1109/TCSVT.2022.3232604

URL: https://ieeexplore.ieee.org/iel7/76/4358651/09999681.pdf

We have added comments in the code, and the specific details can correspond to the explanation in the paper. Please get in touch with me (zhihapeng3-c@my.cityu.edu.hk) if you have any issues.

We appreciate it if you use this code and cite our related papers, which can be cited as follows,

@ARTICLE{9999681,
title={Deep Attention-guided Graph Clustering with Dual Self-supervision},
author={Peng, Zhihao and Liu, Hui and Jia, Yuheng and Hou, Junhui},
journal={IEEE Transactions on Circuits and Systems for Video Technology},
year={2022},
volume={},
number={},
pages={1-1},
doi={10.1109/TCSVT.2022.3232604} }

@article{peng2022graph,
title={Graph Augmentation Clustering Network},
author={Peng, Zhihao and Liu, Hui and Jia, Yuheng and Hou, Junhui},
journal={arXiv preprint arXiv:2211.10627},
year={2022} }

@inproceedings{peng2021attention,
title={Attention-driven graph clustering network},
author={Peng, Zhihao and Liu, Hui and Jia, Yuheng and Hou, Junhui},
booktitle={Proceedings of the 29th ACM International Conference on Multimedia},
pages={935--943},
year={2021} }

Environment

• Python[3.6.12]
• Pytorch[1.9.0+cu102]
• GPU (GeForce RTX 2080 Ti) & (NVIDIA GeForce RTX 3090) & (Quadro RTX 8000)

To run code

• Step 1: choose the data, i.e., [data_name]=acm/cite/dblp/hhar/reut/usps/amap/pubmed/aids
• Step 2: python DAGC.py --name [data_name]

• For examle, if u would like to run AGCN on the ACM dataset, u need to
• run the command "python DAGC.py --name acm"

Evaluation

• eva_previous.py 👉 The commonly used clustering metrics, such as acc, nmi, ari, and f1, etc.
• get_net_par_num.py 👉 Get the network parameters by `print(num_net_parameter(model))', where model is the designed network.

Data

Due to the limitation of GitHub, we share the other data in [here]. The AIDS Antiviral Screen dataset can be found at [here].

Q&A

• Q1: What we use the cosine similarity measure as a distance measure to construct graph data for non-graph datasets?
• A1: KNN graph construction with the Euclidean distance measure fails to exploit the geometric structure information and hence cannot provide an effective KNN graph. Instead, we use the cosine similarity measure as a distance measure to conduct the KNN-k graph construction, since two samples owing to the same cluster tend to have larger absolute cosine values than those lying in different clusters.
• Q2: What device was the experiment run on?
• A2: The experiments are run on the Pytorch platform using an Intel(R) Core(TM) i7-8700K CPU @ 3.70GHz, 32.0GB RAM, and an NVIDIA GeForce RTX 2080-Ti 27.0GB GPU. Notably, for the large-scale dataset, the experiments are run on a dedicated server in the laboratory, which has an Intel(R) Xeon(R) Gold 6226R CPU @ 2.90GHz, a Quadro RTX 8000 49152 MB GPU.