Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) BD
Design and Implementation of a tool for formulating recall-oriented structured queries on semantic networks
Katerina Tzompanaki

01 February 2013, 14h00 - 01 February 2013, 15h30
Salle/Bat : 455/PCRI-N
Contact : jesus.camacho-rodriguez@lri.fr

Activités de recherche :

Résumé :
In the recent years there is a trend towards the creation of massive metadata repositories, usually based on the RDF/S technology, as in the domain of cultural heritage. ISO21127 (CIDOC Conceptual Reference Model) is a rich conceptual model (or ontology) capable of describing the world stored in such repositories. Simpler models like those consisting only of core metadata‖ as in Dublin Core, lack the expressiveness and the potentiality to integrate the knowledge and to apply reasoning on it. Nevertheless, the more complex structure complicates the information searching: the declarative SPARQL query formulation becomes harder for the user due to the large number of ontology classes and properties, while on the other side keyword search does not take advantage of the information structure.

To address this problem, we suggest a new approach: we introduce a simpler model consisting of few fundamental classes and relationships aimed to be used for querying purposes only. Information search with this model is easier and more intuitive for the users, since its size and structure resemble those of the core metadata. Additionally, this model provides high recall rates because in the fundamental relationships we capture the total of potential paths over the CIDOC-CRM and also include property propagation through these paths. With the latter though, we introduce a statistical factor that may deteriorate precision since a property is not necessarily propagated along a path. Precision improvement can be achieved by creating specializations of the fundamental relationships or by adding more constraints on the queries.

To define the paths over the CIDOC-CRM schema that correspond to each fundamental relationship, we have created a paths‘ language‖ which is designed to be easy to write and to be comprehended by non-expert users. Thereafter, we constructed a tool that utilizes this language, permits the editing and validation of the fundamental relationships and their translation to SPARQL and provides extra supportive functions.

The proposed approach was proven adequate for expressing real research queries originating from independent (to this work) scientists in the domain of cultural heritage. The results of queries performed on repositories consisting of real metadata were encouraging, showing even 100% recall, when the repository‘s information was well-structured. Moreover we have shown that the usage of combined FRs in the query can improve the precision rate.

Pour en savoir plus :
Séminaires
A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 29 June 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................

Caractérisation de réseaux égocentrés par l'énumér
Friday 15 June 2018 - 14h30
Salle : 455 - PCRI-N
Raphaël Charbey .............................................

DATA VERACITY ASSESSMENT: HOW A-PRIORI KNOWLEDGE E
Intégration de données et de connaissances
Friday 15 June 2018 - 14h00
Salle : 445 - PCRI-N
Valentina Beretta .............................................