Discovering missing links in large-scale linked data

Abstract

The explosion of linked data is creating sparse connection networks, primarily because more and more missing links among difference data sources are resulting from asynchronous and independent database development. DHR was proposed in other research to discover these links.However, DHR has limitations in a distributed environment. For example, while deploying on a distributed SPARQL server, the data transfer usually causes overhead on the network. Therefore, we propose a new method of detecting a missing link based on DHR. The method consists of two stages: finding the frequent graph and matching the similarity. In this paper, we enhance some features in the two stages to reduce the data flow before querying. We conduct an experiment using geographic data sources with a large number of triples to discover the missing links and compare the accuracy of our proposed matching method with DHR and the primitive mix similarity method. The experimental results show that our method can reduce a large amount of data flow on a network and increase the accuracy of discovering missing links. © 2013 Springer-Verlag.