Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network
Authors: Yifei Sun, Haoran Deng, Yang Yang, Chunping Wang, Jiarong Xu, Renhong Huang, Linfeng Cao, Yang Wang, Lei Chen
IJCAI 2022 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Experimental results demonstrate that our model achieves superior performance in node classification on both heterophily and homophily graphs. Extensive experimental results demonstrate that our model achieves superior performance by up to 10.08% in the node classification task on heterophily graphs and competitive results on homophily graphs. |
| Researcher Affiliation | Collaboration | College of Computer Science and Technology, Zhejiang University Finvolution Group Department of Information Management and Business Intelligence, Fudan University |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | Yes | Codes are available at https://github.com/zjunet/Path Net |
| Open Datasets | Yes | seven real world graph datasets: (1) three widely adopted citation network benchmark: Cora, Pubmed and Citeseer[Kipf and Welling, 2017] with strong homophily; (2) four representative heterophily datasets that span across various domains: Cornell[Rozemberczki et al., 2021], BGP[Luckie et al., 2013], NBA[Dai and Wang, 2021], Electronics[Mc Auley et al., 2015] |
| Dataset Splits | Yes | We use 10 random splits with 48%, 32%, and 20% for training, validation and testing. |
| Hardware Specification | No | The paper discusses computational complexity but does not provide specific hardware details such as GPU/CPU models or memory used for running the experiments. |
| Software Dependencies | No | The paper does not provide specific software dependencies, such as library names with version numbers, required to replicate the experiments. |
| Experiment Setup | Yes | For simplicity, we set the number of paths as 40 for both heterophily and homophily graphs. Moreover, we set the length of paths as 3 for Cora, Citeseer and NBA while 4 for other datasets. We use 1000 epochs for each split. |