首页> 外文会议>Joint international conference on semantic technology >On Enhancing Visual Query Building over KGs Using Query Logs
【24h】

On Enhancing Visual Query Building over KGs Using Query Logs

机译:关于使用查询日志增强KG上的可视查询构建

获取原文

摘要

Knowledge Graphs have recently gained a lot of attention and have been successfully applied in both academia and industry. Since KGs may be very large: they may contain millions of entities and triples relating them to each other, to classes, and assigning them data values, it is important to provide endusers with effective tools to explore information encapsulated in KGs. In this work we present a visual query system that allows users to explore KGs by intuitively constructing tree-shaped conjunctive queries. It is known that systems of this kind suffer from the problem of information overflow: when constructing a query the users have to iteratively choose from a potentially very long list of options, sich as, entities, classes, and data values, where each such choice corresponds to an extension of the query new filters. In order to address this problem we propose an approach to substantially reduce such lists with the help of ranking and by eliminating the so-called deadends, options that yield queries with no answers over a given KG.
机译:知识图谱最近引起了很多关注,并已成功应用于学术界和工业界。由于KG可能非常大:它们可能包含数百万个实体以及将它们彼此关联,关联到类,并为其分配数据值的三元组,因此为最终用户提供有效的工具来探索KG中封装的信息非常重要。在这项工作中,我们提出了一个可视化查询系统,该系统允许用户通过直观地构建树状联合查询来探索KG。众所周知,这类系统存在信息溢出的问题:在构造查询时,用户必须从可能非常长的选项列表(如实体,类和数据值)中进行迭代选择,其中每个这样的选择对应于查询新过滤器的扩展。为了解决这个问题,我们提出了一种方法,即通过排名并通过消除所谓的“死角”来大幅减少此类列表,这些选项产生的查询对于给定的KG没有任何答案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号