{"id":336,"date":"2018-06-22T10:58:11","date_gmt":"2018-06-22T08:58:11","guid":{"rendered":"https:\/\/project.inria.fr\/ekaw2018\/?page_id=336"},"modified":"2018-11-12T12:19:38","modified_gmt":"2018-11-12T11:19:38","slug":"workshops","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/ekaw2018\/workshops\/","title":{"rendered":"Symbolic methods for data-interlinking"},"content":{"rendered":"

Motivation<\/h3>\n

The linked data initiative promotes exposing, sharing and connecting structured data on the Web. Linked Data has brought a large amount of data in the form of RDF triples, described using terms of RDFS and OWL ontologies, with currently more than 149 billions of triples distributed over datasets from many different domains (media, life sciences, geography). This has attracted many organizational bodies that today publish and consume linked data, ranging from private companies, to public institutions like governments, national libraries or academic institutions.<\/p>\n

An important added value of linked data comes from the links that identify the same entity in different datasets, which allows developing innovative applications exploiting data cross-references and making inferences between datasets. Therefore, the task of deciding whether two resources identified by two URIs and described in RDF over possibly different datasets refer to the same real-world entity is critical for widening and enhancing linked data. This task, that we refer to as data interlinking, is a knowledge discovery task as it infers knowledge \u2014the condition for identity of objects\u2014 from large volume of data.<\/p>\n

There are two main approaches to data-interlinking, respectively based on numerical and symbolic methodologies. Both approaches rely on the identification of the properties to compare. While numerical methods focus on similarity metrics used to compare property values, symbolic methods aim to extract rules and to employ logical reasoning to link instances belonging to different RDF datasets.<\/p>\n

This workshop is organised in the framework of the AnR project ELKER and\u00a0aims to gathering researchers interested in the topics of key discovery,\u00a0link keys, rule discovery in RDF data, data-interlinking\/key discovery\u00a0with refinement operators, as well as software frameworks, evaluation,\u00a0applications, case studies, etc. Even though rooted in symbolic\u00a0frameworks, this workshop also aims at exploring the bridges between the\u00a0symbolic and the numerical approaches, to work towards a common unifying\u00a0framework.<\/p>\n

Submissions<\/h4>\n

Contributions to the workshop can be made in terms of “statements of\u00a0interest” (2 page long) addressing different issues of\u00a0data-interlinking. All contributions should be prepared in PDF format\u00a0and should be submitted through the workshop submission site at:
\nhttps:\/\/easychair.org\/conferences\/?conf=symbolicdiekaw2018<\/a><\/span><\/p>\n