在知识库中使用关键字查找模式以组成表格答案
Finding Patterns in a Knowledge Base using Keywords to Compose Table Answers
摘要:
我们的目标是提供表答案的关键字查询对知识库。对于引用多个实体的查询,如“华盛顿城市人口”和“梅尔吉布森电影”,最好将每个相关答案表示为一个表,该表在同一表方案或模式内聚合一组实体或实体连接。在本文中,我们研究了如何找到高度相关的模式在知识库中的用户给定的关键字查询组成表的答案。知识库可以被建模为称为知识图谱的有向图,其中节点表示知识库中的实体,边表示它们之间的关系。每个节点/边都标有类型和文本。模式是包含文本中所有关键字的子树的聚合,并且在节点/边缘上具有相同的结构和类型。我们提出了有效的算法来找到相关的一类评分函数的查询模式。我们在理论上的问题的硬度,并提出基于路径的索引,是负担得起的内存。提出了两种查询处理算法:一种是利用索引对小查询(答案为小模式)进行快速处理的算法;另一种是理论上更好的算法,其运行时间与索引和答案的大小成线性关系,可以更好地处理大查询。我们还进行了广泛的实验研究,比较我们的方法与一个天真的适应已知的技术。
英文摘要:
We aim to provide table answers to keyword queries against knowledge bases. For queries referring to multiple entities, like "Washington cities population" and "Mel Gibson movies", it is better to represent each relevant answer as a table which aggregates a set of entities or entity-joins within the same table scheme or pattern. In this paper, we study how to find highly relevant patterns in a knowledge base for user-given keyword queries to compose table answers. A knowledge base can be modeled as a directed graph called knowledge graph, where nodes represent entities in the knowledge base and edges represent the relationships among them. Each node/edge is labeled with type and text. A pattern is an aggregation of subtrees which contain all keywords in the texts and have the same structure and types on node/edges. We propose efficient algorithms to find patterns that are relevant to the query for a class of scoring functions. We show the hardness of the problem in theory, and propose path-based indexes that are affordable in memory. Two query-processing algorithms are proposed: one is fast in practice for small queries (with small patterns as answers) by utilizing the indexes; and the other one is better in theory, with running time linear in the sizes of indexes and answers, which can handle large queries better. We also conduct extensive experimental study to compare our approaches with a naive adaption of known techniques.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。