Symbolic methods for data-interlinking @EKAW2018
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.
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 —the condition for identity of objects— from large volume of data.
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.
This workshop is motivated by symbolic methods but also aims at exploring the bridges between symbolic and numerical approaches. Its main objectives are to discuss and better understand the differences and the similarities between approaches, to work towards a common unifying framework. Topics include (but are not limited to): key discovery, link keys, rule discovery in RDF data, data-interlinking/key discovery with refinement operators, as well as software frameworks, evaluation, applications, case studies, etc.
Contributions to the workshop can be made in terms of technical papers and posters/statements of interest addressing different issues of data-interlinking. Technical papers should not exceed 12 pages using the LNCS Style. Posters/statements of interest should not exceed 2 pages and should be handled according to the guidelines for technical papers. All contributions should be prepared in PDF format and should be submitted (no later than September 8th, 2018) through the workshop submission site at: https://easychair.org/conferences/?conf=symbolicdiekaw2018
- Submission deadline: 8 September 2018
- Acceptance/Rejection of Papers: 1 October 2018
- Workshop days: 12 or 13 November 2018
- Miguel Couceiro, Université de Lorraine, Nancy, France
- Jérôme David, Université Pierre-Mendès-France, Grenoble, France
- Adrien Coulet, University of Lorraine, Nancy, France
- Luis Galárraga, Inria, IRISA, Rennes, France
- Jorge Gracia, University of Zaragoza, Spain
- Nathalie Pernelle, Paris Sud University, France
- Fatiha Saïs, Paris Sud University, France
- Pavel Shvaiko, Informatica Trentina, Trento, Italy
- Konstantin Todorov, University of Montpellier, Montpellier, France
- Ondřej Zamazal, University of Economics, Prague, Czech Republic