Français Anglais
Accueil Annuaire Plan du site
Home > Research results > Dissertations & habilitations
Research results
Thesis in progress de RAKOTOARISON Herilalaina
RAKOTOARISON Herilalaina
Thesis in progress
Group : Learning and Optimization

Sélection et configuration automatiques d’algorithmes d’optimisation pour des réseaux de distribution électriques régionaux ou locaux

Starts on 01/11/2017
Advisor : SCHOENAUER, Marc

Funding : contrat doctoral INRIA
Affiliation : Université Paris-Sud
Laboratory : LRI - AO

Defended on 00/00/0000, committee :

Research activities :

Abstract :


Ph.D. dissertations & Faculty habilitations
KNOWLEDGE GRAPH REFINEMENT: LINK DETECTION, LINK INVALIDATION, KEY DISCOVERY AND DATA ENRICHMENT
This habilitation thesis outlines some methods and tools resulting from my research activities during the last ten years as well as my scientific projects for a near future. These methods and tools have been developed for knowledge graph refinement in the context of Web of data. We are experiencing an unprecedented production of resources published as Linked Open Data (LOD, for short). This has led to the creation of knowledge graphs (KGs) containing billions of RDF (Resource Description Framework) triples, such as DBpedia, YAGO and Wikidata on the academic side, and the Google Knowledge Graph or eBay Knowledge Graph or Facebook Graph on the commercial side. However, building knowledge graphs while ensuring their completeness and correctness, is a challenging endeavour. For this challenging problem, my research contributions have focused on several issues. First, identity link invalidation problem for which we developed two main approaches relying on either the semantics of ontology axioms to detect inconsistency in the KGs or on the network structure of identity links to assign an error degree for every identity link in the LOD. Second, in the settings of scientific KGs, we defined a generic approach for detecting contextual identity links representing a weak identity relation between entities that is valid in an explicit context expressed as a sub-part of the ontology. This approach is a contribution to the overcoming problem of the strict semantics of owl:sameAs}predicate, that is not required in all application domains. Third, we proposed a data fusion approach that is able to aggregate data coming from different sources and to compute a unique representation for a set of given linked entities. Furthermore, to deal with missing value prediction, we developed an approach that relies on data linking and case-based reasoning to predict missing values. Finally, to enrich the conceptual level of KGs with new key axioms, that are particularly important for detecting identity links, we defined three efficient methods: KD2R, for discovering exact keys, SAKey for discovering n-almost keys and VICKEY for discovering conditional keys. These three methods are based on computing first the maximal non-keys and then deriving the minimal keys, and apply several strategies to prune the search space. Overall these approaches have been developed in collaboration with several fellow researchers, in the setting of several PhD theses, post-docs and master theses; some of them in the context of ANR, CNRS and industrial research projects, involving different organisms and companies, such as, INRA, INA, ABES, IGN and Thalès.

HUMAN-COMPUTER INTERACTION AND INTERACTION DESIGN


FORMAL VERIFICATION FOR NUMERICAL COMPUTATIONS,AND THE OTHER WAY AROUND