用多曲率空间捕捉异构图中复杂结构,提升嵌入效果
Metapath-based Hyperbolic Contrastive Learning for Heterogeneous Graph Embedding
- 基于元路径设计多个双曲空间,分别建模不同语义结构
- 对比学习使同元路径嵌入更近、异元路径更远,增强区分性
- 适用于复杂异构图任务,如推荐、分类等场景
双曲空间具有恒定负曲率和指数扩张特性,与异构图的结构特征高度契合。然而,现有异构图嵌入模型大多依赖单一双曲空间,难以有效捕捉异构图中多样的幂律结构。为此,我们提出基于元路径的双曲对比学习框架(MHCL),通过多个双曲空间分别描述不同元路径对应的复杂结构分布,从而有效捕获语义信息。由于元路径嵌入代表不同语义,聚合时需保持其可区分性。因此,我们采用对比学习优化MHCL:在双曲空间中最小化同元路径嵌入距离,最大化异元路径间距离,提升不同语义嵌入的可分性。大量实验表明,MHCL在多种图机器学习任务中优于当前最优基线,能有效捕捉异构图的复杂结构。
原文摘要 · Abstract (English)
The hyperbolic space, characterized by a constant negative curvature and exponentially expanding space, aligns well with the structural properties of heterogeneous graphs. However, although heterogeneous graphs inherently possess diverse power-law structures, most hyperbolic heterogeneous graph embedding models rely on a single hyperbolic space. This approach may fail to effectively capture the diverse power-law structures within heterogeneous graphs. To address this limitation, we propose a Metapath-based Hyperbolic Contrastive Learning framework (MHCL), which uses multiple hyperbolic spaces to capture diverse complex structures within heterogeneous graphs. Specifically, by learning each hyperbolic space to describe the distribution of complex structures corresponding to each metapath, it is possible to capture semantic information effectively. Since metapath embeddings represent distinct semantic information, preserving their discriminability is important when aggregating them to obtain node representations. Therefore, we use a contrastive learning approach to optimize MHCL and improve the discriminability of metapath embeddings. In particular, our contrastive learning method minimizes the distance between embeddings of the same metapath and maximizes the distance between those of different metapaths in hyperbolic space, thereby improving the separability of metapath embeddings with distinct semantic information. We conduct comprehensive experiments to evaluate the effectiveness of MHCL. The experimental results demonstrate that MHCL outperforms state-of-the-art baselines in various graph machine learning tasks, effectively capturing the complex structures of heterogeneous graphs.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。