通过双通道超图学习,更精准地评估异构知识图谱中节点的重要性。
DualHNIE: Dual-Channel Hypergraph Learning for Node Importance Estimation in Heterogeneous Knowledge Graphs
- 构建基于元路径的超边,显式建模高阶关系模式。
- 在多个数据集上超越现有方法,提升重要性估计准确率。
- 适合研究知识图谱推荐与决策系统的学者参考。
在异构知识图谱中估计节点重要性是推荐、搜索和知识决策系统的基础问题。然而,现有方法多依赖成对消息传递机制,无法捕捉由元关系结构引发的高阶交互。此外,结构拓扑与语义属性通常在同一嵌入空间中纠缠,模糊了其独立归纳偏置,限制了重要性表征的区分能力。为此,我们提出DualHNIE,一种面向节点重要性估计的双通道超图学习框架。该框架首先通过元路径序列构建高阶知识图谱,形成类型化超边,实现对高阶关系模式的显式建模;随后引入两个互补编码器:结构感知超图注意力网络,在元路径诱导的超边上执行局部归一化聚合,以捕捉局部结构依赖;稀疏分块超图变换器则在保持可扩展计算的前提下,捕获全局语义交互。我们还设计了带有辅助监督的对比对齐机制,确保跨视图一致性的同时保留模态特异性表示。在多个基准数据集上的大量实验表明,DualHNIE显著优于当前最优方法,验证了显式高阶建模与解耦双通道表征学习的有效性。代码与数据集已公开。
原文摘要 · Abstract (English)
Estimating node importance in heterogeneous knowledge graphs is a fundamental problem underlying recommendation, search, and knowledge decision systems. However, most existing methods rely on pairwise message passing mechanisms that fail to capture higher-order interactions induced by meta-relational structures. Furthermore, structural topology and semantic attributes are typically entangled within a unified embedding space, which obscures their distinct inductive biases and limits the discriminative capacity of learned importance representations. To address these limitations, we propose DualHNIE, a principled dual-channel hypergraph learning framework for node importance estimation. DualHNIE first constructs a higher-order knowledge graph by forming typed hyperedges from meta-path sequences, enabling explicit modeling of higher-order relational patterns. It then introduces two complementary encoders: a structure-aware hypergraph attention network that performs locally normalized aggregation over meta-path--induced hyperedges to capture localized structural dependencies, and a sparse--chunked hypergraph transformer that captures global semantic interactions while maintaining scalable computation. We further design a contrastive alignment mechanism with auxiliary supervision, ensuring cross-view consistency while preserving modality-specific representation. Extensive experiments on multiple benchmark datasets demonstrate that DualHNIE outperforms state-of-the-art methods, validating the effectiveness of explicit high-order modeling and disentangled dual-channel representation learning for heterogeneous knowledge graphs. Code and datasets are available\footnote[1]{https://github.com/jiawenchen10/DualHNIE}.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。