Toshitaka Maki, Kazuki Takahashi, T. Wakahara, A. Kodate, N. Sonehara
{"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":"4 1","pages":"115-121"},"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}
引用次数: 4
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.