首页> 外文会议>International Conference on Database Systems for Advanced Applications >Mutual Relation Detection for Complex Question Answering over Knowledge Graph
【24h】

Mutual Relation Detection for Complex Question Answering over Knowledge Graph

机译:关于知识图表的复杂问题的相互关系检测

获取原文

摘要

Question Answering over Knowledge Graph (KG-QA) becomes a convenient way to interact with the prevailing information. The user's information needs, i.e., input questions become more complex. We find that the comparison, relation, and opinion questions are witnessed a significant growth, especially in some domains. However, most of the current KG-QA methods cannot appropriately handle the inherent complex relation and coverage characteristics within the questions. In this work, we propose to utilize the relation information with the questions and knowledge graph in a mutual way, improving the final question answering performance. Wse design local and global attention models for relation detection. We combine the features for relation detection in an attention matching model. Experiments on our new dataset and common dataset reveal its advantages both in accuracy and efficiency.
机译:关于知识图表(kg-qa)的问题成为与现行信息交互的便捷方式。用户的信息需求,即输入问题变得更加复杂。我们发现比较,关系和意见问题得到了重要的增长,特别是在某些领域。然而,大多数当前的KG-QA方法不能适当地处理问题中的固有复杂关系和覆盖特征。在这项工作中,我们建议以相互互动的方式利用与问题和知识图的关系信息,改善最终的问题回答性能。 WSE设计本地和全球关注模型,用于关系检测。我们将特征结合在关注匹配模型中的关系检测。我们的新数据集和常用数据集的实验显示其精度和效率的优点。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号