项目介绍

yueliu1999/HSAN 是一个托管在 GitHub 上的开源项目,主要使用 Python 编写,目前获得 212 个 Star、29 次 Fork。

仓库全名
yueliu1999/HSAN
Star 数
212
Fork 数
29
未关闭 Issue
6

README 摘要

[stars-url]: https://github.com/yueliu1999/HSAN/stargazers [fork-url]: https://github.com/yueliu1999/HSAN/network/members [adgc-url]: https://github.com/yueliu1999/HSAN Hard Sample Aware Network An official source code for paper Hard Sample Aware Network for Contrastive Deep Graph Clustering, accepted by AAAI 2023. Any communications or issues are welcomed. Please contact [email protected]. If you find this…

完整内容见 GitHub 原始 README 或本页 。

常见问题

HSAN 用什么语言开发?

主要使用 Python 编写,目前有 212 个 Star。

如何获取 HSAN 的源码?

可以直接克隆仓库:git clone https://github.com/yueliu1999/HSAN.git,默认分支为 main;安装与运行步骤见仓库 README。

HSAN 最近还在维护吗?

仓库最近一次更新为 2022年12月20日,当前有 6 个未关闭 Issue;Star 数为 212,可作为社区活跃度的参考。

关于

GitHub 原始描述(英文)

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

描述取自 GitHub 官方 API,保持仓库作者书写的原文。

语言占比

Python

贡献者

README

Hard Sample Aware Network

GitHub stars GitHub forks visitors

An official source code for paper Hard Sample Aware Network for Contrastive Deep Graph Clustering, accepted by AAAI 2023. Any communications or issues are welcomed. Please contact [email protected]. If you find this repository useful to your research or work, it is really appreciate to star this repository. :heart:


Overview

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.

Figure 1: Illustration of the proposed Hard Sample Aware Network (HSAN).

Requirements

The proposed HSAN is implemented with python 3.7 on a NVIDIA 3090 GPU.

Python package information is summarized in requirements.txt:

  • torch==1.7.1
  • tqdm==4.59.0
  • numpy==1.19.2
  • munkres==1.1.4
  • scikit_learn==1.2.0

Quick Start

  • Step1: use the cora.zip file or download other datasets from Awesome Deep Graph Clustering/Benchmark Datasets

  • Step2: unzip the dataset into the ./dataset folder

  • Step3: run

    python train.py
    

    the clustering results will be recorded in the ./results.csv file

Parameter settings

Table 1: Parameter settings of six datasets.

Clustering Results

Table 2: Clustering results of our proposed HSAN and thirteen baselines on six datasets.
Figure 2: 2D t-SNE visualization of seven methods on two datasets.

Citation

If you find this project useful for your research, please cite your paper with the following BibTeX entry.

@inproceedings{HSAN,
  title={Hard Sample Aware Network for Contrastive Deep Graph Clustering},
  author={Liu, Yue and Yang, Xihong and Zhou, Sihang and Liu, Xinwang and Wang, Zhen and Liang, Ke and Tu, Wenxuan and Li, Liang and Duan, Jingcan, and Chen, Cancan},
  booktitle={Proc. of AAAI},
  year={2023}
}

@article{Deep_graph_clustering_survey,
 author = {Liu, Yue and Xia, Jun and Zhou, Sihang and Wang, Siwei and Guo, Xifeng and Yang, Xihong and Liang, Ke and Tu, Wenxuan and Li, Z. Stan and Liu, Xinwang},
 journal = {arXiv preprint arXiv:2211.12875},
 title = {A Survey of Deep Graph Clustering: Taxonomy, Challenge, and Application},
 year = {2022}
}

评论

暂无评论