考虑谓词补充关联数据知识库的资源传播算法

Toshitaka Maki, Kazuki Takahashi, T. Wakahara, A. Kodate, N. Sonehara
{"title":"考虑谓词补充关联数据知识库的资源传播算法","authors":"Toshitaka Maki, Kazuki Takahashi, T. Wakahara, A. Kodate, N. Sonehara","doi":"10.1504/IJSSC.2018.10015593","DOIUrl":null,"url":null,"abstract":"Linked data are directed graph data with descriptive labels using uniform resource identifiers (URI) and based on resource description framework (RDF). Linked data which are published as open data on the web are called linked open data (LOD). LOD is popular as a technology for constructing the semantic web because it can create a knowledge base by linking various resources. However, a large amount of the linked data does not have sufficient links since resources defined by URI type are scarce. Therefore, this paper presents a new resource propagation algorithm (RPA) which predicts links between resources in the linked data, and complements the knowledge bases by considering predicates in the RDF structure. The presented experiment demonstrates that the RPA was able to complement semantic links between resources considering each predicate.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Resource propagation algorithm considering predicates to complement knowledge bases in linked data\",\"authors\":\"Toshitaka Maki, Kazuki Takahashi, T. Wakahara, A. Kodate, N. Sonehara\",\"doi\":\"10.1504/IJSSC.2018.10015593\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Linked data are directed graph data with descriptive labels using uniform resource identifiers (URI) and based on resource description framework (RDF). Linked data which are published as open data on the web are called linked open data (LOD). LOD is popular as a technology for constructing the semantic web because it can create a knowledge base by linking various resources. However, a large amount of the linked data does not have sufficient links since resources defined by URI type are scarce. Therefore, this paper presents a new resource propagation algorithm (RPA) which predicts links between resources in the linked data, and complements the knowledge bases by considering predicates in the RDF structure. The presented experiment demonstrates that the RPA was able to complement semantic links between resources considering each predicate.\",\"PeriodicalId\":43931,\"journal\":{\"name\":\"International Journal of Space-Based and Situated Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Space-Based and Situated Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJSSC.2018.10015593\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Space-Based and Situated Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJSSC.2018.10015593","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

链接数据是带有描述性标签的有向图数据,使用统一资源标识符(URI)并基于资源描述框架(RDF)。在网络上作为开放数据发布的链接数据称为链接开放数据(LOD)。LOD作为一种构建语义网的技术非常受欢迎,因为它可以通过链接各种资源来创建知识库。但是,由于URI类型定义的资源很少,因此大量链接的数据没有足够的链接。为此,本文提出了一种新的资源传播算法(RPA),该算法通过考虑RDF结构中的谓词来预测关联数据中资源之间的链接,并对知识库进行补充。实验表明,RPA能够考虑每个谓词来补充资源之间的语义链接。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resource propagation algorithm considering predicates to complement knowledge bases in linked data
Linked data are directed graph data with descriptive labels using uniform resource identifiers (URI) and based on resource description framework (RDF). Linked data which are published as open data on the web are called linked open data (LOD). LOD is popular as a technology for constructing the semantic web because it can create a knowledge base by linking various resources. However, a large amount of the linked data does not have sufficient links since resources defined by URI type are scarce. Therefore, this paper presents a new resource propagation algorithm (RPA) which predicts links between resources in the linked data, and complements the knowledge bases by considering predicates in the RDF structure. The presented experiment demonstrates that the RPA was able to complement semantic links between resources considering each predicate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Space-Based and Situated Computing
International Journal of Space-Based and Situated Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信