AEGIS:针对稀疏双图知识图谱的链接预测中的真实边增长
AEGIS: Authentic Edge Growth In Sparsity for Link Prediction in Edge-Sparse Bipartite Knowledge Graphs
AI总结:
针对稀疏双图知识图谱的链接预测问题,提出AEGIS框架,通过重采样现有训练边以保持节点集并避免伪造端点,结合自然稀疏图和诱导稀疏性基准进行验证,结果显示语义KNN增强在文本丰富图中效果最佳。
摘要:
在专业领域中,双图知识图谱通常数据贫乏且边稀疏,这阻碍了链接预测。我们引入AEGIS(真实边增长在稀疏性中),一种仅边增强框架,通过均匀简单或逆度偏倚度感知的方式重采样现有训练边,从而保留原始节点集并避开伪造端点。为了在不同情况下探测真实性,我们考虑自然稀疏图(游戏设计模式的游戏-模式网络)和通过高率bond percolation在更密集的基准(Amazon、MovieLens)中诱导稀疏性。我们评估增强效果于两个互补指标:AUC-ROC(越高越好)和Brier分数(越低越好),使用双尾配对t检验对比稀疏基线。在Amazon和MovieLens中,基于复制的AEGIS变体与基线匹配,而语义KNN增强是唯一能恢复AUC和校准的方法;随机和合成边仍有害。在文本丰富的GDP图中,语义KNN实现了最大的AUC改进和Brier分数降低,简单方法也相对稀疏对照降低了Brier分数。这些发现将真实性约束的重采样定位为稀疏双图链接预测的数据高效策略,当有信息性节点描述时,语义增强提供额外的提升。
英文摘要:
Bipartite knowledge graphs in niche domains are typically data-poor and edge-sparse, which hinders link prediction. We introduce AEGIS (Authentic Edge Growth In Sparsity), an edge-only augmentation framework that resamples existing training edges -either uniformly simple or with inverse-degree bias degree-aware -thereby preserving the original node set and sidestepping fabricated endpoints. To probe authenticity across regimes, we consider naturally sparse graphs (game design pattern's game-pattern network) and induce sparsity in denser benchmarks (Amazon, MovieLens) via high-rate bond percolation. We evaluate augmentations on two complementary metrics: AUC-ROC (higher is better) and the Brier score (lower is better), using two-tailed paired t-tests against sparse baselines. On Amazon and MovieLens, copy-based AEGIS variants match the baseline while the semantic KNN augmentation is the only method that restores AUC and calibration; random and synthetic edges remain detrimental. On the text-rich GDP graph, semantic KNN achieves the largest AUC improvement and Brier score reduction, and simple also lowers the Brier score relative to the sparse control. These findings position authenticity-constrained resampling as a data-efficient strategy for sparse bipartite link prediction, with semantic augmentation providing an additional boost when informative node descriptions are available.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。