FHGE: A Fast Heterogeneous Graph Embedding with Ad-hoc Meta-paths

TL;DR

FHGE introduces a fast, retraining-free method for generating meta-path-guided graph embeddings in heterogeneous graphs, significantly reducing training costs and enabling real-time, ad-hoc query processing.

Contribution

The paper proposes FHGE, a novel framework that efficiently produces meta-path-guided embeddings without retraining, using segmentation, reconstruction, and dual attention mechanisms.

Findings

FHGE achieves high accuracy in link prediction and node classification.

It significantly reduces training time compared to existing HGNNs.

Demonstrates effectiveness across diverse datasets.

Abstract

Graph neural networks (GNNs) have emerged as the state of the art for a variety of graph-related tasks and have been widely used in Heterogeneous Graphs (HetGs), where meta-paths help encode specific semantics between various node types. Despite the revolutionary representation capabilities of existing heterogeneous GNNs (HGNNs) due to their focus on improving the effectiveness of heterogeneity capturing, the huge training costs hinder their practical deployment in real-world scenarios that frequently require handling ad-hoc queries with user-defined meta-paths. To address this, we propose FHGE, a Fast Heterogeneous Graph Embedding designed for efficient, retraining-free generation of meta-path-guided graph embeddings. The key design of the proposed framework is two-fold: segmentation and reconstruction modules. It employs Meta-Path Units (MPUs) to segment the graph into local and global components, enabling swift integration of node embeddings from relevant MPUs during reconstruction and allowing quick adaptation to specific meta-paths. In addition, a dual attention mechanism is applied to enhance semantics capturing. Extensive experiments across diverse datasets demonstrate the effectiveness and efficiency of FHGE in generating meta-path-guided graph embeddings and downstream tasks, such as link prediction and node classification, highlighting its significant advantages for real-time graph analysis in ad-hoc queries.