Bridging Feature-structural Homophily and Long-range Heterogeneity for Self-supervised Heterogeneous Graph Learning
TL;DR
This work proposes a self-expressive solver that captures the complementary homophily between meta-paths and node features to obtain ho-mophilous representations and designs separate path encoders to model diverse interactions, thus explicitly including cross-type interactions while mitigating noise via adaptive fusion.
Abstract
Self-supervised heterogeneous graph learning has achieved promising results in diverse applications but still faces two issues: (i) existing methods focus on either feature similarity or meta-path to capture homophily, neglecting their inherent complementarity; (ii) existing methods rely on meta-paths to capture interactions among same-type nodes, which may introduce noise and inherently exclude long-range cross-type interactions. To address these issues, we first propose a self-expressive solver that captures the complementary homophily between meta-paths and node features to obtain homophilous representations. Meanwhile, we design separate path encoders to model diverse interactions, thus explicitly including cross-type interactions while mitigating noise via adaptive fusion. Theoretical analysis verifies that homophilous representations exhibit a high-order grouping effect to capture complementary homophily, while path encoders possess adaptive smoothness capabilities to filter noise. Extensive experiments on diverse datasets, including a large-scale dataset, demonstrate the superiority of the proposed method.