arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.08925cs.CL
收藏

基于知识图谱的复杂查询生成的组合泛化性基准测试

Benchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge Graphs

HKUST(香港科技大学);Tsinghua University(清华大学);Peng Cheng Laboratory(鹏城实验室)

Zihao Wang, Hang Yin, Yangqiu Song

摘要:

复杂查询推理是知识图谱上的一个重要推理任务。目前的CQA学习模型已经被证明能够从原子算子推广到更复杂的公式,这可以被视为组合推广。在本文中,我们提出了EFO-1-QA,这是一个新的数据集,通过包括301种不同的查询类型来衡量CQA模型的组合泛化能力,这是现有数据集的20倍。此外,我们的工作,第一次提供了一个基准,以评估和分析不同的运营商和范式的影响,通过使用(a)7个选择的运营商系统和(b)9种形式的复杂查询。具体地说,我们提供了两个常用的运营商,即,投影和交集,并证明给定操作符的规范选择的查询形式的影响。我们的代码和数据可以提供一个有效的管道来基准CQA模型。

英文摘要:

Complex Query Answering (CQA) is an important reasoning task on knowledge graphs. Current CQA learning models have been shown to be able to generalize from atomic operators to more complex formulas, which can be regarded as the combinatorial generalizability. In this paper, we present EFO-1-QA, a new dataset to benchmark the combinatorial generalizability of CQA models by including 301 different queries types, which is 20 times larger than existing datasets. Besides, our work, for the first time, provides a benchmark to evaluate and analyze the impact of different operators and normal forms by using (a) 7 choices of the operator systems and (b) 9 forms of complex queries. Specifically, we provide the detailed study of the combinatorial generalizability of two commonly used operators, i.e., projection and intersection, and justify the impact of the forms of queries given the canonical choice of operators. Our code and data can provide an effective pipeline to benchmark CQA models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑