MOSIG Master 2ND
Identifying equivalent resources across different data sets allows reasoning with the information in both data sets. It is possible to extract, from the two data sets alone, link keys which, in turns, can directly find links between such resources. We aim at improving such link key extraction techniques so that they take advantage of ontologies describing the data sets.
The goal of the semantic web is to take advantage of formalised knowledge at the scale of the worldwide web. This has led to the release of a vast quantity of data expressed in semantic web formalisms (RDF) [Heath 2011a]. Part of the added value of linked data lies in the links identifying the same entity in different data sets as it allows for making inference between data sets. For instance, they may identify the same books and articles in different bibliographical data sources. So finding the manifestation of the same entity across several data sets is an important task of linked data.
One way of identifying entities is to use link keys which are a generalisation of keys usually found in data bases to several data sets. A link key [Atencia 2014b] is a statement such as:
We have taken advantage of techniques to extract concepts between two interdependent ordered sets, namely Formal concept analysis (FCA [Ganter 1999a]) and Relational Concept Analysis (RCA [Hacene 2013a]), in order to extract link key candidate across two data sets [Atencia 2014d, Vizzini 2017a].
Although such processes have been found very accurate, they do not take into account the ontologies. The goal of this master topic is to take advantage of the ontology content and the ontology language in order to improve the extracted link keys.
Indeed, it may be that a link key condition is more general than another and that the system does not take advantage of it. This is the case if the link key is:
In addition, the lack of expressivity of considered link keys may forbid to find relevant ones. In particular if a data set uses a relation auteur and another hasWritten, then these properties are not comparable. So, our extraction techniques are ineffective. However, hasWritten and writtenBy are inverse. It would be useful to take advantage of such pairs in order to find better link keys, i.e., finding:
Of course, all these operations may increase or decrease the complexity of the link key extraction process. Hence, their introduction will have to be progressive and carefully studied.
This work is related to the Elker ANR project for which a PhD position is available.
[Atencia 2014b] Manuel Atencia, Jérôme David, Jérôme Euzenat, Data interlinking through robust link key extraction, Proc. 21st ECAI, Prague (CK), pp15-20, 2014
[Atencia 2014d] Manuel Atencia, Jérôme David, Jérôme Euzenat, What can FCA do for database link key extraction?, Proc. ECAI workshop on "what can FCA do for AI?", Prague (CK), 2014
[Ganter 1999a] Bernhard Ganter, Rudolf Wille, Formal concept analysis: mathematical foundations, Springer, Berlin (DE), 1999
[Heath 2011a] Tom Heath and Christian Bizer, Linked Data: Evolving the Web into a Global Data Space, Morgan & Claypool, 2011
[Hacene 2013a] Mohamed Rouane Hacene, Marianne Huchard, Amedeo Napoli, Petko Valtchev, Relational concept analysis: mining concept lattices from multi-relational data, Annals of Mathematics and Artificial Intelligence
[Vizzini 2017a] Jérémy Vizzini, Data interlinking with relational concept analysis, Mémoire de Master Informatique, option Data science, Université Grenoble Alpes, 2017
Reference number: Proposal n°2374
Master profile: M2R MOSIG, Artificial intelligence and the web profile.
Advisor: Jérôme Euzenat (Jerome:Euzenat#inria:fr) and Jérôme David (Jerome:David#inria:fr).
Team: The work will be carried out in the mOeX team common to INRIA & Université Grenoble Alpes. mOeX is dedicated to study knowledge evolution through adaptation. It gather permanent researchers from the Exmo team which has taken an active part these past 15 years in the development of the semantic web and more specifically ontology matching.
Procedure: Contact us and provide vitæ, motivation letter and references.