首页> 外文会议>Annual Meeting of the Association for Computational Linguistics;International Joint Conference on natural Language Processing >Robust Knowledge Graph Completion with Stacked Convolutions and a Student Re-Ranking Network
【24h】

Robust Knowledge Graph Completion with Stacked Convolutions and a Student Re-Ranking Network

机译:强大的知识图表完成与堆叠卷曲和学生重新排名网络

获取原文

摘要

Knowledge Graph (KG) completion research usually focuses on densely connected benchmark datasets that are not representative of real KGs. We curate two KG datasets that include biomedical and encyclopedic knowledge and use an existing commonsense KG dataset to explore KG completion in the more realistic setting where dense connectivity is not guaranteed. We develop a deep convolu-tional network that utilizes textual entity representations and demonstrate that our model outperforms recent KG completion methods in this challenging setting. We find that our model's performance improvements stem primarily from its robustness to sparsity. We then distill the knowledge from the convolutional network into a student network that re-ranks promising candidate entities. This re-ranking stage leads to further improvements in performance and demonstrates the effectiveness of entity re-ranking for KG completion.
机译:知识图表(kg)完成研究通常侧重于不代表真正的公斤的密集连接的基准数据集。 我们策划了两个kg数据集,包括生物医学和百科全书知识,并使用现有的通信kg数据集来探索在更现实的环境中探索KG完成,其中无法保证密集的连接。 我们开发了一个深度卷积的网络,利用文本实体表示,并证明我们的模型优于最近的近距离完成方法。 我们发现,我们的模型的性能改善主要从其疲劳到稀疏性。 然后,我们将知识从卷积网络从卷积到重新排名有前途的候选实体中的学生网络中。 此重新排名阶段导致性能的进一步改进,并展示了实体重新排名的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号