HP-GMN: Graph Memory Networks for Heterophilous Graphs

Junjie Xu, Enyan Dai, Xiang Zhang, Suhang Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


Graph neural networks (GNNs) have achieved great success in various graph problems. However, most GNNs are Message Passing Neural Networks (MPNNs) based on the homophily assumption, where nodes with the same label are connected in graphs. Real-world problems bring us heterophily problems, where nodes with different labels are connected in graphs. MPNNs fail to address the heterophily problem because they mix information from different distributions and are not good at capturing global patterns. Therefore, we investigate a novel Graph Memory Networks model on Heterophilous Graphs (HP-GMN) to the heterophily problem in this paper. In HP-GMN, local information and global patterns are learned by local statistics and the memory to facilitate the prediction. We further propose regularization terms to help the memory learn global information. We conduct extensive experiments to show that our method achieves state-of-the-art performance on both homophilous and heterophilous graphs. The code of this paper can be found at https://github.com/junjie-xu/HP-GMN.

Original languageEnglish (US)
Title of host publicationProceedings - 22nd IEEE International Conference on Data Mining, ICDM 2022
EditorsXingquan Zhu, Sanjay Ranka, My T. Thai, Takashi Washio, Xindong Wu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781665450997
StatePublished - 2022
Event22nd IEEE International Conference on Data Mining, ICDM 2022 - Orlando, United States
Duration: Nov 28 2022Dec 1 2022

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
ISSN (Print)1550-4786


Conference22nd IEEE International Conference on Data Mining, ICDM 2022
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • General Engineering

Cite this