数据集细节问题

[ccmature]

您好，正在拜读您的论文和代码，您的研究工作对我的研究有很大启发，非常感谢您的分享。

在阅读您的代码的时候，我对数据集中两个邻接矩阵的生成方式有一些疑问。想请教一下，这两个邻接矩阵是如何得到的？以及，关于邻接矩阵的生成或预处理过程，是否有更详细的描述，在哪一部分可以具体找到？我已经查看了论文和代码的相关部分，但可能仍有遗漏。

[zxlearningdeep]

Hello, thank you very much for your question. We have open-sourced the complete dataset preprocessing code "data_process.py", as shown in the figure below.

Specifically, the adjacency matrices of the multiplex graph are extracted from publicly available heterogeneous graph datasets using different meta-paths. By utilizing meta-paths, we can transform the heterogeneous graph into homogeneous graphs with multiplex structures. You can refer to our code for the detailed dataset preprocessing process. If you want to learn more about heterogeneous graphs and meta-paths, we recommend the following papers:

1. Wang, Xiao, et al. “Heterogeneous graph attention network.” The World Wide Web Conference. 2019.
2. Shen, Zhixiang, and Zhao Kang. “When Heterophily Meets Heterogeneous Graphs: Latent Graphs Guided Unsupervised Representation Learning.” arXiv preprint arXiv:2409.00687 (2024).

I hope this helps! If you have any further questions, feel free to ask.