用双曲空间提升异构图建模,兼顾局部与全局结构。
Hyperbolic Heterogeneous Graph Transformer
- 基于Transformer架构,在双曲空间内直接建模异构图。
- 在节点分类任务中性能超越现有方法,训练时间更短、内存更低。
- 适配不同关系类型的注意力机制,高效捕捉复杂层次结构。
在异构图中,常存在树状或层级结构。近年来,双曲空间被广泛用于有效学习此类复杂结构。尽管已有方法展现了双曲空间的优势,但多数仍依赖切空间操作,频繁转换易引发映射畸变;且消息传递架构主要关注局部邻域信息,难以捕捉全局层级结构和跨类型节点的长程依赖。为此,我们提出双曲异构图Transformer(HypHGT),可在双曲空间内完全、高效地学习异构图表示。与以往基于消息传递的双曲异构GNN不同,HypHGT通过Transformer架构自然捕捉局部与全局依赖。其提出的关联特定双曲注意力机制具有线性时间复杂度,实现高效计算的同时保留不同关系类型的信息。该设计使HypHGT能有效捕获异构图中的复杂结构特性与语义信息。我们在多个数据集上进行实验,结果表明,该方法在节点分类任务中持续优于当前最优方法,且显著降低训练时间和内存消耗。
原文摘要 · Abstract (English)
In heterogeneous graphs, we can observe complex structures such as tree-like or hierarchical structures. Recently, the hyperbolic space has been widely adopted in many studies to effectively learn these complex structures. Although these methods have demonstrated the advantages of the hyperbolic space in learning heterogeneous graphs, most existing methods still have several challenges. They rely heavily on tangent-space operations, which often lead to mapping distortions during frequent transitions. Moreover, their message-passing architectures mainly focus on local neighborhood information, making it difficult to capture global hierarchical structures and long-range dependencies between different types of nodes. To address these limitations, we propose Hyperbolic Heterogeneous Graph Transformer (HypHGT), which effectively and efficiently learns heterogeneous graph representations entirely within the hyperbolic space. Unlike previous message-passing based hyperbolic heterogeneous GNNs, HypHGT naturally captures both local and global dependencies through transformer-based architecture. Furthermore, the proposed relation-specific hyperbolic attention mechanism in HypHGT, which operates with linear time complexity, enables efficient computation while preserving the heterogeneous information across different relation types. This design allows HypHGT to effectively capture the complex structural properties and semantic information inherent in heterogeneous graphs. We conduct comprehensive experiments to evaluate the effectiveness and efficiency of HypHGT, and the results demonstrate that it consistently outperforms state-of-the-art methods in node classification task, with significantly reduced training time and memory usage.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。