Resource propagation algorithm considering predicates to complement knowledge bases in linked data Online publication date: Mon, 03-Sep-2018
by Toshitaka Maki; Kazuki Takahashi; Toshihiko Wakahara; Akihisa Kodate; Noboru Sonehara
International Journal of Space-Based and Situated Computing (IJSSC), Vol. 8, No. 2, 2018
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Space-Based and Situated Computing (IJSSC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook