17 th International Conference in Knowledge Based and Intelligent Information and Engineering Systems - KES2013 Interlinking documents based on semantic graphs

Connectivity and relatedness of Web resources are two concepts that define to what extent di erent parts are connected or related to one another. Measuring connectivity and relatedness between Web resources is a growing field of research, often the starting point of recommender systems. Although relatedness is liable to subjective interpretations, connectivity is not. Given the Semantic Web’s ability of linking Web resources, connectivity can be measured by exploiting the links between entities. Further, these connections can be exploited to uncover relationships between Web resources. In this paper, we apply and expand a relationship assessment methodology from social network theory to measure the connectivity between documents. The connectivity measures are used to identify connected and related Web resources. Our approach is able to expose relations that traditional text-based approaches fail to identify. We validate and assess our proposed approaches through an evaluation on a real world dataset, where results show that the proposed techniques outperform state of the art approaches. c 2013 The Authors. Published by Elsevier B.V. Selection and peer-review under responsibility of KES International.

[1]  Evgeniy Gabrilovich,et al.  Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis , 2007, IJCAI.

[2]  Samir Khuller,et al.  Link Prediction for Annotation Graphs Using Graph Summarization , 2011, SEMWEB.

[3]  S. Dumais Latent Semantic Analysis. , 2005 .

[4]  Amit P. Sheth,et al.  Semantic Association Identification and Knowledge Discovery for National Security Applications , 2005, J. Database Manag..

[5]  Stefan Dietze,et al.  Information organization on the internet based on heterogeneous social networks , 2011, SIGDOC '11.

[6]  Mohammad Al Hasan,et al.  A Survey of Link Prediction in Social Networks , 2011, Social Network Data Analytics.

[7]  David W. Embley,et al.  Discovering direct and indirect matches for schema elements , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..

[8]  George Kollios,et al.  k-nearest neighbors in uncertain graphs , 2010, Proc. VLDB Endow..

[9]  Wolfgang Nejdl,et al.  Combining a co-occurrence-based and a semantic measure for entity linking , 2013 .

[10]  Diana Maynard,et al.  Entity Extraction and Consolidation for Social Web Content Preservation , 2012, SDA.

[11]  Jens Lehmann,et al.  RelFinder: Revealing Relationships in RDF Knowledge Bases , 2009, SAMT.

[12]  James A. Hendler,et al.  A Method to Rank Nodes in an RDF Graph , 2008, International Semantic Web Conference.

[13]  Wolfgang Nejdl,et al.  Can Entities be Friends? , 2012, WoLE@ISWC.

[14]  Erhard Rahm,et al.  Mapping Composition for Matching Large Life Science Ontologies , 2011, ICBO.

[15]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[16]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[17]  Frank van Harmelen,et al.  Using Google distance to weight approximate ontology matches , 2007, WWW '07.

[18]  Cong Yu,et al.  REX: Explaining Relationships between Entity Pairs , 2011, Proc. VLDB Endow..

[19]  Marco A. Casanova,et al.  Query Processing in a Mediator Based Framework for Linked Data Integration , 2011, Int. J. Bus. Data Commun. Netw..

[20]  Milan Stankovic,et al.  Linked Data-Based Concept Recommendation: Comparison of Different Methods in Open Innovation Scenario , 2012, ESWC.

[21]  Kenneth Ward Church,et al.  Word Association Norms, Mutual Information, and Lexicography , 1989, ACL.