首页> 外文会议>International conference on web engineering >Beyond Established Knowledge Graphs-Recommending Web Datasets for Data Linking
【24h】

Beyond Established Knowledge Graphs-Recommending Web Datasets for Data Linking

机译:超越已建立的知识图谱-推荐用于数据链接的Web数据集

获取原文

摘要

With the explosive growth of the Web of Data in terms of size and complexity, identifying suitable datasets to be linked, has become a challenging problem for data publishers. To understand the nature of the content of specific datasets, we adopt the notion of dataset profiles, where datasets are characterized through a set of topic annotations. In this paper, we adopt a collaborative filtering-like recommendation approach, which exploits both existing dataset profiles, as well as traditional dataset connectivity measures, in order to link arbitrary, non-profiled datasets into a global dataset-topic-graph. Our experiments, applied to all available Linked Datasets in the Linked Open Data (LOD) cloud, show an average recall of up to 81 %, which translates to an average reduction of the size of the original candidate dataset search space to up to 86 %. An additional contribution of this work is the provision of benchmarks for dataset interlinking recommendation systems.
机译:随着数据网络在规模和复杂性方面的爆炸性增长,确定合适的数据集进行链接已成为数据发布者面临的难题。为了了解特定数据集内容的性质,我们采用了数据集概要文件的概念,其中数据集通过一组主题注释来表征。在本文中,我们采用类似协作式过滤的推荐方法,该方法利用现有的数据集配置文件以及传统的数据集连接性度量,以便将任意的,非配置文件的数据集链接到全局数据集主题图中。我们的实验应用于链接开放数据(LOD)云中所有可用的链接数据集,显示平均召回率高达81%,这意味着原始候选数据集搜索空间的大小平均减少了多达86% 。这项工作的另一个贡献是为数据集链接推荐系统提供了基准。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号