-
Pierre Allard and Sébastien Ferré.
Recherche de dépendances fonctionnelles et de règles d'association avec OLAP.
In S. Ben Yahia and J.-M. Petit, editors,
Extraction et Gestion des Connaissances,
volume RNTI-E-19 of Revue des Nouvelles Technologies de l'Information,
pages 651-652,
2010.
Cépaduès-Éditions.
Keyword(s): association rule,
functional dependency,
OLAP,
navigation.
Abstract: |
Dans le domaine des bases de données, les outils de calcul de règles d'association et de dépendances fonctionnelles affichent traditionnellement les résultats sous forme d'une liste de règles, difficiles à lire. Nous proposons ici de projeter une relation d'une base de données sur un cube de données OLAP, afin d'afficher ces règles de manière plus structurée et plus intuitive. De plus, nous montrons que les liens de navigation d'OLAP peuvent aider l'utilisateur à naviguer dans ces règles produites. |
@inproceedings{AlaFer2010,
author = {Pierre Allard and Sébastien Ferré},
title = {Recherche de dépendances fonctionnelles et de règles d'association avec {OLAP}},
booktitle = {Extraction et Gestion des Connaissances},
year = {2010},
pages = {651-652},
editor = {S. Ben~Yahia and J.-M. Petit},
publisher = {Cépaduès-Éditions},
series = {Revue des Nouvelles Technologies de l'Information},
volume = {RNTI-E-19},
keywords = {association rule, functional dependency, OLAP, navigation},
abstract = {Dans le domaine des bases de données, les outils de calcul de règles d'association et de dépendances fonctionnelles affichent traditionnellement les résultats sous forme d'une liste de règles, difficiles à lire. Nous proposons ici de projeter une relation d'une base de données sur un cube de données OLAP, afin d'afficher ces règles de manière plus structurée et plus intuitive. De plus, nous montrons que les liens de navigation d'OLAP peuvent aider l'utilisateur à naviguer dans ces règles produites.},
}
-
Peggy Cellier,
Mireille Ducassé,
Sébastien Ferré,
and Olivier Ridoux.
Fouille de données pour la localisation de fautes dans les programmes (poster).
In 2ième journées nationales du Groupement de Recherche CNRS du Génie de la Programmation et du Logiciel (GDR GPL),
2010.
Université de Pau et des Pays de l'Adour.
@inproceedings{CDFR2010,
author = {Peggy Cellier and Mireille Ducass\'{e} and S\'{e}bastien Ferr\'{e} and Olivier Ridoux},
title = {Fouille de données pour la localisation de fautes dans les programmes (poster)},
booktitle = {2ième journées nationales du Groupement de Recherche CNRS du Génie de la Programmation et du Logiciel (GDR GPL)},
publisher = {Université de Pau et des Pays de l'Adour},
year = {2010}
}
-
Sébastien Ferré.
Conceptual Navigation in RDF Graphs with SPARQL-Like Queries.
In L. Kwuida and B. Sertkaya, editors,
Int. Conf. Formal Concept Analysis,
LNCS 5986,
pages 193-208,
2010.
Springer.
Keyword(s): conceptual navigation,
semantic web,
RDF,
SPARQL,
querying,
navigation.
Abstract: |
Concept lattices have been successfully used for information retrieval and browsing. They offer the advantage of combining querying and navigation in a consistent way. Conceptual navigation is more flexible than hierarchical navigation, and easier to use than plain querying. It has already been applied to formal, logical, and relational contexts, but its application to the semantic web is a challenge because of inference mechanisms and expressive query languages such as SPARQL. The contribution of this paper is to extend conceptual navigation to the browsing of RDF graphs, where concepts are accessed through SPARQL-like queries. This extended conceptual navigation is proved consistent w.r.t. the context (i.e., never leads to an empty result set), and complete w.r.t. the conjunctive fragment of the query language (i.e., every query can be reached by navigation only). Our query language has an expressivity similar to SPARQL, and has a more natural syntax close to description logics. |
@inproceedings{Fer2010,
author = {Sébastien Ferré},
title = {Conceptual Navigation in {RDF} Graphs with {SPARQL}-Like Queries},
booktitle = {Int. Conf. Formal Concept Analysis},
year = {2010},
pages = {193-208},
editor = {L. Kwuida and B. Sertkaya},
publisher = {Springer},
series = {LNCS 5986},
keywords = {conceptual navigation, semantic web, RDF, SPARQL, querying, navigation},
abstract = {Concept lattices have been successfully used for information retrieval and browsing. They offer the advantage of combining querying and navigation in a consistent way. Conceptual navigation is more flexible than hierarchical navigation, and easier to use than plain querying. It has already been applied to formal, logical, and relational contexts, but its application to the semantic web is a challenge because of inference mechanisms and expressive query languages such as SPARQL. The contribution of this paper is to extend conceptual navigation to the browsing of RDF graphs, where concepts are accessed through SPARQL-like queries. This extended conceptual navigation is proved consistent w.r.t. the context (i.e., never leads to an empty result set), and complete w.r.t. the conjunctive fragment of the query language (i.e., every query can be reached by navigation only). Our query language has an expressivity similar to SPARQL, and has a more natural syntax close to description logics.},
}
-
Annie Foret and Sébastien Ferré.
On Categorial Grammars as Logical Information Systems.
In L. Kwuida and B. Sertkaya, editors,
Int. Conf. Formal Concept Analysis,
LNCS 5986,
pages 225-240,
2010.
Springer.
Keyword(s): logical information systems,
categoarial grammar,
pregroup,
browsing.
Abstract: |
We explore different perspectives on how categorial grammars can be considered as Logical Information Systems (LIS) both theoretically, and practically. Categorial grammars already have close connections with logic. We discuss the advantages of integrating both approaches. We consider more generally different ways of connecting computational linguistic data and LIS as an application of Formal Concept Analysis. |
@inproceedings{ForFer2010,
author = {Annie Foret and Sébastien Ferré},
title = {On Categorial Grammars as Logical Information Systems},
booktitle = {Int. Conf. Formal Concept Analysis},
year = {2010},
pages = {225-240},
editor = {L. Kwuida and B. Sertkaya},
publisher = {Springer},
series = {LNCS 5986},
keywords = {logical information systems, categoarial grammar, pregroup, browsing},
abstract = {We explore different perspectives on how categorial grammars can be considered as Logical Information Systems (LIS) both theoretically, and practically. Categorial grammars already have close connections with logic. We discuss the advantages of integrating both approaches. We consider more generally different ways of connecting computational linguistic data and LIS as an application of Formal Concept Analysis.},
}