Towards Transfer Learning of Link Specifications

Over the last years, link discovery frameworks have been employed successfully to create links between knowledge bases. Consequently, repositories of high-quality link specifications have been created and made available on the Web. The basic question underlying this work is the following: Can the specifications in these repositories be reused to ease the detection of link specifications between unlinked knowledge bases? In this paper, we address this question by presenting a formal transfer learning framework that allows detecting existing specifications that can be used as templates for specifying links between previously unlinked knowledge bases. We discuss both the advantages and the limitations of such an approach for determining link specifications. We evaluate our approach on a variety of link specifications from several domains and show that the detection of accurate link specifications for use as templates can be achieved with high reliability.

[1]  Qiang Yang,et al.  A Survey on Transfer Learning , 2010, IEEE Transactions on Knowledge and Data Engineering.

[2]  Jens Lehmann,et al.  Template-based question answering over RDF data , 2012, WWW.

[3]  Axel-Cyrille Ngonga Ngomo,et al.  EAGLE: Efficient Active Learning of Link Specifications Using Genetic Programming , 2012, ESWC.

[4]  Robert Isele,et al.  Efficient Multidimensional Blocking for Link Discovery without losing Recall , 2011, WebDB.

[5]  Frank van Harmelen,et al.  OWL Reasoning with WebPIE: Calculating the Closure of 100 Billion Triples , 2010, ESWC.

[6]  Enrico Motta,et al.  Unsupervised Learning of Link Discovery Configuration , 2012, ESWC.

[7]  Jens Lehmann,et al.  Can We Create Better Links by Playing Games? , 2013, 2013 IEEE Seventh International Conference on Semantic Computing.

[8]  Tamar Domany,et al.  Enterprise Data Classification Using Semantic Web Technologies , 2010, SEMWEB.

[9]  Jens Lehmann,et al.  RAVEN : Towards Zero-Configuration Link Discovery , 2013 .

[10]  Jérôme Euzenat,et al.  Ontology Matching: State of the Art and Future Challenges , 2013, IEEE Transactions on Knowledge and Data Engineering.

[11]  Axel-Cyrille Ngonga Ngomo,et al.  A time-efficient hybrid approach to link discovery , 2011, OM.

[12]  Axel Polleres,et al.  Some entities are more equal than others: statistical methods to consolidate Linked Data , 2010 .

[13]  Katja Hose,et al.  FedX: Optimization Techniques for Federated Query Processing on Linked Data , 2011, SEMWEB.

[14]  Timothy W. Finin,et al.  Computing FOAF Co-reference Relations with Rules and Machine Learning , 2010 .

[15]  Raghav Kaushik,et al.  On active learning of record matching packages , 2010, SIGMOD Conference.

[16]  Claudia Niederée,et al.  Eliminating the redundancy in blocking-based entity resolution methods , 2011, JCDL '11.