首页> 外文期刊>Semantic web >RDF2Vec: RDF graph embeddings and their applications
【24h】

RDF2Vec: RDF graph embeddings and their applications

机译:RDF2VEC:RDF Graph Embeddings及其应用程序

获取原文
获取原文并翻译 | 示例
           

摘要

Linked Open Data has been recognized as a valuable source for background information in many data mining and information retrieval tasks. However, most of the existing tools require features in propositional form, i.e., a vector of nominal or numerical features associated with an instance, while Linked Open Data sources are graphs by nature. In this paper, we present RDF2Vec, an approach that uses language modeling approaches for unsupervised feature extraction from sequences of words, and adapts them to RDF graphs. We generate sequences by leveraging local information from graph sub-structures, harvested by Weisfeiler-Lehman Subtree RDF Graph Kernels and graph walks, and learn latent numerical representations of entities in RDF graphs. We evaluate our approach on three different tasks: (i) standard machine learning tasks, (ii) entity and document modeling, and (iii) content-based recommender systems. The evaluation shows that the proposed entity embeddings outperform existing techniques, and that pre-computed feature vector representations of general knowledge graphs such as DBpedia and Wikidata can be easily reused for different tasks.
机译:链接开放数据已被识别为许多数据挖掘和信息检索任务中的背景信息的有价值的源。然而,大多数现有工具需要以命题形式,即与实例相关联的标称或数值特征的向量中的特征,而链接的开放数据源是自然界的。在本文中,我们呈现RDF2VEC,一种方法,一种方法,它使用语言建模方法从单词序列中提取无监督的功能提取,并将它们适应RDF图。我们通过从图形子结构中利用本地信息来生成序列,由Weisfeiler-Lehman Subtree RDF Graph核和图形步行收获,并在RDF图中学习实体的潜在数值表示。我们在三个不同的任务中评估我们的方法:(i)标准机器学习任务,(ii)实体和文档建模,和(iii)基于内容的推荐系统。评估表明,所提出的实体嵌入式优于现有技术,并且可以轻松地重新利用不同的知识图,例如DBPedia和Wikidata的预先计算的特征向量表示,可以很容易地重复使用不同的任务。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号