Heterophilic Graph Representation Learning Based on Multi-Order Information Extraction and High and Low Pass Filters

Real-world networks can be divided into homophilic and heterophilic graphs. Significantly, many nodes tend to be heterophilic in a homophilic graph. Graph representation learning in heterophilic graphs has attracted considerable significance in recent years as it breaks the homophily assumption and achieves higher-quality graph embeddings. However, existing heterophilic graph representation learning methods often mix attribute and topological information, neglecting the mutual exclusion between attribute information and topological information. Furthermore, algorithms in heterogeneous graphs usually rely on specific matrix structures to capture high-order information, which may restrict the applicability of these methods. To tackle these issues, this paper proposes a GNN-based strategy for Heterophilic graph Representation Learning based on Multi-order information extraction and High and Low pass filters (HRLMHL). First, we designed two relatively independent modules to learn attribute information and topological information, respectively, to address the issue of mismatch. Second, we built a multi-order information extraction module to extract multi-order similarity features, thereby achieving the learning of high-order graph information. Experiments on real datasets show that the node classification accuracy is superior to that of the state-of-the-art methods on most datasets.