首页> 外文会议>International conference on knowledge engineering and knowledge management >An Evolutionary Algorithm to Learn SPARQL Queries for Source-Target-Pairs: Finding Patterns for Human Associations in DBpedia
【24h】

An Evolutionary Algorithm to Learn SPARQL Queries for Source-Target-Pairs: Finding Patterns for Human Associations in DBpedia

机译:学习针对源-目标对的SPARQL查询的进化算法:DBpedia中人类协会的查找模式

获取原文
获取外文期刊封面目录资料

摘要

Efficient usage of the knowledge provided by the Linked Data community is often hindered by the need for domain experts to formulate the right SPARQL queries to answer questions. For new questions they have to decide which datasets are suitable and in which terminology and modelling style to phrase the SPARQL query. In this work we present an evolutionary algorithm to help with this challenging task. Given a training list of source-target node-pair examples our algorithm can learn patterns (SPARQL queries) from a SPARQL endpoint. The learned patterns can be visualised to form the basis for further investigation, or they can be used to predict target nodes for new source nodes. Amongst others, we apply our algorithm to a dataset of several hundred human associations (such as "circle - square") to find patterns for them in DBpedia. We show the scalability of the algorithm by running it against a SPARQL endpoint loaded with > 7.9 billion triples. Further, we use the resulting SPARQL queries to mimic human associations with a Mean Average Precision (MAP) of 39.9% and a Recall@10 of 63.9%.
机译:领域专家需要制定正确的SPARQL查询来回答问题,这常常阻碍了链接数据社区所提供知识的有效利用。对于新问题,他们必须确定哪些数据集合适以及用哪种术语和建模风格来表达SPARQL查询。在这项工作中,我们提出了一种进化算法来帮助完成这一具有挑战性的任务。给定源-目标节点对示例的培训列表,我们的算法可以从SPARQL端点学习模式(SPARQL查询)。可以将学习到的模式可视化以形成进一步研究的基础,或者可以将它们用于预测新源节点的目标节点。除其他外,我们将算法应用于数百个人类协会(例如“圆形-正方形”)的数据集,以在DBpedia中找到它们的模式。通过在加载了> 79亿三元组的SPARQL端点上运行该算法,可以显示该算法的可伸缩性。此外,我们使用生成的SPARQL查询以39.9%的平均平均精度(MAP)和63.9%的Recall @ 10模仿人类关联。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号