GLINKX: A Scalable Unified Framework for Homophilous and Heterophilous Graphs

Marios Papachristou, Rishab Goel, Frank Portman, Matthew Miller, Rong Jin

Keywords: graph learning, node classification, homophily, heterophily, positional embeddings, knowledge graph embeddings, monophily, label propagation

TL;DR: Scalable method for node classification for homophilous and heterophilous graphs

Abstract: In graph learning, there have been two main inductive biases regarding graph-inspired architectures: On the one hand, higher-order interactions and message passing work well on homophilous graphs and are leveraged by GCNs and GATs. Such architectures, however, cannot easily scale to large real-world graphs. On the other hand, shallow (or node-level) models using ego features and adjacency embeddings work well in heterophilous graphs. In this work, we propose a novel scalable shallow method -- GLINKX -- that can work both on homophilous and heterophilous graphs. To achieve scale in large graphs, GLINKX leverages (i) novel monophilous label propagations, (ii) ego/node features, (iii) knowledge graph embeddings as positional embeddings, (iv) node-level training, and (v) low-dimensional message passing. We show the effectiveness of GLINKX on several homophilous and heterophilous datasets. An extended version of this work can be found at http://arxiv.org/abs/2211.00550.