基于知识图的图嵌入查询构造

Ruijie Wang, M. Wang, Jun Liu, Siyu Yao, Q. Zheng
{"title":"基于知识图的图嵌入查询构造","authors":"Ruijie Wang, M. Wang, Jun Liu, Siyu Yao, Q. Zheng","doi":"10.1109/ICBK.2018.00009","DOIUrl":null,"url":null,"abstract":"Graph-structured queries provide an efficient way to retrieve the desired data from large-scale knowledge graphs. However, it is difficult for non-expert users to write such queries, and users prefer expressing their query intention through natural language questions. Therefore, automatically constructing graph-structured queries of given natural language questions has received wide attention in recent years. Most existing methods rely on natural language processing techniques to perform the query construction process, which is complicated and time-consuming. In this paper, we focus on the query construction process and propose a novel framework which stands on recent advances in knowledge graph embedding techniques. Our framework first encodes the underlying knowledge graph into a low-dimensional embedding space by leveraging the generalized local knowledge graphs. Then, given a natural language question, our framework computes the structure of the target query and determines the vertices/edges which form the target query based on the learned embedding vectors. Finally, the target graph-structured query is constructed according to the query structure and determined vertices/edges. Extensive experiments were conducted on the benchmark dataset. The results demonstrate that our framework outperforms several state-of-the-art baseline models regarding effectiveness and efficiency.","PeriodicalId":144958,"journal":{"name":"2018 IEEE International Conference on Big Knowledge (ICBK)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Graph Embedding Based Query Construction Over Knowledge Graphs\",\"authors\":\"Ruijie Wang, M. Wang, Jun Liu, Siyu Yao, Q. Zheng\",\"doi\":\"10.1109/ICBK.2018.00009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph-structured queries provide an efficient way to retrieve the desired data from large-scale knowledge graphs. However, it is difficult for non-expert users to write such queries, and users prefer expressing their query intention through natural language questions. Therefore, automatically constructing graph-structured queries of given natural language questions has received wide attention in recent years. Most existing methods rely on natural language processing techniques to perform the query construction process, which is complicated and time-consuming. In this paper, we focus on the query construction process and propose a novel framework which stands on recent advances in knowledge graph embedding techniques. Our framework first encodes the underlying knowledge graph into a low-dimensional embedding space by leveraging the generalized local knowledge graphs. Then, given a natural language question, our framework computes the structure of the target query and determines the vertices/edges which form the target query based on the learned embedding vectors. Finally, the target graph-structured query is constructed according to the query structure and determined vertices/edges. Extensive experiments were conducted on the benchmark dataset. The results demonstrate that our framework outperforms several state-of-the-art baseline models regarding effectiveness and efficiency.\",\"PeriodicalId\":144958,\"journal\":{\"name\":\"2018 IEEE International Conference on Big Knowledge (ICBK)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Big Knowledge (ICBK)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICBK.2018.00009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Big Knowledge (ICBK)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBK.2018.00009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

图结构查询提供了一种从大规模知识图中检索所需数据的有效方法。然而,非专业用户很难编写这样的查询,用户更喜欢通过自然语言问题来表达他们的查询意图。因此,自动构造给定自然语言问题的图结构查询近年来受到了广泛的关注。现有的方法大多依赖于自然语言处理技术来执行查询构建过程,该过程复杂且耗时。在本文中,我们关注查询的构建过程,并在知识图嵌入技术的最新进展的基础上提出了一个新的框架。我们的框架首先利用广义局部知识图将底层知识图编码为低维嵌入空间。然后,给定一个自然语言问题,我们的框架计算目标查询的结构,并根据学习到的嵌入向量确定构成目标查询的顶点/边。最后,根据查询结构和确定的顶点/边构造目标图结构查询。在基准数据集上进行了大量的实验。结果表明,我们的框架在有效性和效率方面优于几个最先进的基线模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Graph Embedding Based Query Construction Over Knowledge Graphs
Graph-structured queries provide an efficient way to retrieve the desired data from large-scale knowledge graphs. However, it is difficult for non-expert users to write such queries, and users prefer expressing their query intention through natural language questions. Therefore, automatically constructing graph-structured queries of given natural language questions has received wide attention in recent years. Most existing methods rely on natural language processing techniques to perform the query construction process, which is complicated and time-consuming. In this paper, we focus on the query construction process and propose a novel framework which stands on recent advances in knowledge graph embedding techniques. Our framework first encodes the underlying knowledge graph into a low-dimensional embedding space by leveraging the generalized local knowledge graphs. Then, given a natural language question, our framework computes the structure of the target query and determines the vertices/edges which form the target query based on the learned embedding vectors. Finally, the target graph-structured query is constructed according to the query structure and determined vertices/edges. Extensive experiments were conducted on the benchmark dataset. The results demonstrate that our framework outperforms several state-of-the-art baseline models regarding effectiveness and efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信