Abstract
AbstractOne of the main obstacles in publishing in a Linked Data way is to connect the dataset being published externally with related data sources in the cloud, known as Data Interlinking. This paper proposes LinkD, a new element-based interlinking approach. LinkD interlinks an RDF dataset, resulted from transformed semi-structured data, with its counterparts in the web of Linked Data. To provide similarity links, the existence of published data in the Linked Data cloud is done in the first place. Different algorithms for similarity measurement are employed while the domain of the dataset being interlinked is taken into account. The techniques utilised allow the processing of a large number of Linked Data datasets. The evaluation of LinkD shows high precision, recall and performance.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference57 articles.
1. Abele A, McCrae J (2017) The Linking Open Data cloud diagram http://lod-cloud.net/ Accessed 25 June 2017
2. Volz J, Bizer C, Gaedke M, Kobilarov G (2009) Silk-a link discovery framework for the web of data. In: Proceedings of the WWW2009 Workshop on Linked Data on the Web-Volume 538. CEUR-WS.org
3. Groza T, Grimnes GA, Handschuh S, Decker S (2013) From raw publications to linked data. Knowl Inf Syst 34(1):1–21
4. Hu W, Yang R, Qu Y (2014) Automatically generating data linkages using class-based discriminative properties. Data & Knowledge Engineering 91:34–51
5. Yuliana OY, Chang C-H (2018) A novel alignment algorithm for effective web data extraction from singleton-item pages. Appl Intell 48(11):4355–4370