-
Olivier Bedel,
Sébastien Ferré,
and Olivier Ridoux.
Développements logiciels en géomatique -- innovations et mutualisations,
chapter GEOLIS : un système d'information logique pour l'organisation et la recherche de données géolocalisées,
pages 149-180.
Information géographique et Aménagement du Territoire.
Hermes/Lavoisier,
2012.
Keyword(s): logical information systems,
geographical information systems,
geo-located data.
@InBook{BedFerRid2012fr,
author = {Olivier Bedel and Sébastien Ferré and Olivier Ridoux},
editor = {B. Bucher and F. Le~Ber},
title = {Développements logiciels en géomatique -- innovations et mutualisations},
chapter = {{GEOLIS} : un système d'information logique pour l'organisation et la recherche de données géolocalisées},
publisher = {Hermes/Lavoisier},
year = {2012},
series = {Information géographique et Aménagement du Territoire},
pages = {149-180},
keywords = {logical information systems, geographical information systems, geo-located data},
}
-
Olivier Bedel,
Sébastien Ferré,
and Olivier Ridoux.
GEOLIS: a Logical Information System to Organize and Search Geo-Located Data.
In B. Bucher and F. Le Ber, editors, Innovative Software Development in GIS,
Geographical Information Systems Series,
pages 151-188.
Wiley,
2012.
Keyword(s): logical information systems,
geographical information systems,
geo-located data.
@InCollection{BedFerRid2012en,
author = {Olivier Bedel and Sébastien Ferré and Olivier Ridoux},
editor = {B. Bucher and F. Le~Ber},
booktitle = {Innovative Software Development in GIS},
title = {{GEOLIS}: a Logical Information System to Organize and Search Geo-Located Data},
publisher = {Wiley},
year = {2012},
series = {Geographical Information Systems Series},
pages = {151-188},
keywords = {logical information systems, geographical information systems, geo-located data},
}
-
Denis Béchet,
Alexandre Dikovsky,
and Annie Foret.
Categorial grammars with iterated types form a strict hierarchy of k-valued languages.
Theor. Comput. Sci.,
450:22-30,
2012.
@article{DBLP:journals/tcs/BechetDF12,
author = {Denis Béchet and Alexandre Dikovsky and Annie Foret},
title = {Categorial grammars with iterated types form a strict hierarchy of k-valued languages},
journal = {Theor. Comput. Sci.},
volume = {450},
year = {2012},
pages = {22-30},
ee = {http://dx.doi.org/10.1016/j.tcs.2012.04.024},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
-
Sébastien Ferré and Alice Hermann.
Reconciling faceted search and query languages for the Semantic Web.
Int. J. Metadata, Semantics and Ontologies,
7(1):37-54,
2012.
Keyword(s): semantic web,
query languages,
faceted search,
query-based faceted search.
Abstract: |
Faceted search and querying are two well-known paradigms to search the Semantic Web. Querying languages, such as SPARQL, offer expressive means for searching RDF datasets, but they are difficult to use. Query assistants help users to write well-formed queries, but they do not prevent empty results. Faceted search supports exploratory search, i.e., guided navigation that returns rich feedbacks to users, and prevents them to fall in dead-ends (empty results). However, faceted search systems do not offer the same expressiveness as query languages. We introduce {\em Query-based Faceted Search} (QFS), the combination of an expressive query language and faceted search, to reconcile the two paradigms. We formalize the navigation of faceted search as a navigation graph, where navigation places are queries, and navigation links are query transformations. We prove that this navigation graph is {\em safe} (no dead-end), and {\em complete} (every query that is not a dead-end can be reached by navigation). In this paper, the LISQL query language generalizes existing semantic faceted search systems, and covers most features of SPARQL. A prototype, Sewelis, has been implemented, and a usability evaluation demonstrated that QFS retains the ease-of-use of faceted search, and enables users to build complex queries with little training. |
@Article{FerHer2012ijmso,
author = {Sébastien Ferré and Alice Hermann},
title = {Reconciling faceted search and query languages for the {Semantic} {Web}},
journal = {Int. J. Metadata, Semantics and Ontologies},
year = {2012},
volume = {7},
number = {1},
pages = {37-54},
keywords = {semantic web, query languages, faceted search, query-based faceted search},
abstract = {Faceted search and querying are two well-known paradigms to search the Semantic Web. Querying languages, such as SPARQL, offer expressive means for searching RDF datasets, but they are difficult to use. Query assistants help users to write well-formed queries, but they do not prevent empty results. Faceted search supports exploratory search, i.e., guided navigation that returns rich feedbacks to users, and prevents them to fall in dead-ends (empty results). However, faceted search systems do not offer the same expressiveness as query languages. We introduce {\em Query-based Faceted Search} (QFS), the combination of an expressive query language and faceted search, to reconcile the two paradigms. We formalize the navigation of faceted search as a navigation graph, where navigation places are queries, and navigation links are query transformations. We prove that this navigation graph is {\em safe} (no dead-end), and {\em complete} (every query that is not a dead-end can be reached by navigation). In this paper, the LISQL query language generalizes existing semantic faceted search systems, and covers most features of SPARQL. A prototype, Sewelis, has been implemented, and a usability evaluation demonstrated that QFS retains the ease-of-use of faceted search, and enables users to build complex queries with little training.},
}
-
Nicolas Béchet,
Peggy Cellier,
Thierry Charnois,
and Bruno Crémilleux.
Discovering Linguistic Patterns Using Sequence Mining.
In Alexander F. Gelbukh, editor,
Int. Conf. on Computational Linguistics and Intelligent Text Processing (CICLing),
volume 7181 of LNCS,
pages 154-165,
2012.
Springer.
Keyword(s): data mining,
sequential patterns,
linguistic pattern,
natural language processing.
@inproceedings{BCCC12,
author = {Nicolas Béchet and Peggy Cellier and Thierry Charnois and Bruno Crémilleux},
title = {Discovering Linguistic Patterns Using Sequence Mining},
booktitle = {Int. Conf. on Computational Linguistics and Intelligent Text Processing (CICLing)},
year = {2012},
pages = {154-165},
publisher = {Springer},
series = {LNCS},
volume = {7181},
isbn = {978-3-642-28603-2},
keywords = {data mining, sequential patterns, linguistic pattern, natural language processing},
editor = {Alexander F. Gelbukh}
}
-
Nicolas Béchet,
Peggy Cellier,
Thierry Charnois,
and Bruno Crémilleux.
Fouille de motifs séquentiels pour la découverte de relations entre gènes et maladies rares.
In S. Szulman and J. Charlet, editors,
Journées francophones d'ingénierie des connaissances,
pages 149-164,
2012.
INSERM UMPC.
[WWW]
Keyword(s): data mining,
sequential patterns,
relationships,
bioinformatics,
rare disease,
natural language processing.
@InProceedings{BCCC2012ic,
author = {Nicolas Béchet and Peggy Cellier and Thierry Charnois and Bruno Crémilleux},
title = {Fouille de motifs séquentiels pour la découverte de relations entre gènes et maladies rares},
booktitle = {Journées francophones d'ingénierie des connaissances},
pages = {149-164},
year = {2012},
editor = {S. Szulman and J. Charlet},
organization = {INSERM UMPC},
url = {http://ics.upmc.fr/},
isbn = {978-2-7466-4577-6},
keywords = {data mining, sequential patterns, relationships, bioinformatics, rare disease, natural language processing}
}
-
Nicolas Béchet,
Peggy Cellier,
Thierry Charnois,
and Bruno Crémilleux.
Sequential Pattern Mining to Discover Relations between Genes and Rare Diseases.
In IEEE Int. Symp. on Computer-Based Medical Systems (CBMS),
pages 1-6,
2012.
Keyword(s): data mining,
sequential patterns,
relationships,
bioinformatics,
rare disease,
natural language processing.
@InProceedings{BCCC2012cbms,
author = {Nicolas Béchet and Peggy Cellier and Thierry Charnois and Bruno Crémilleux},
title = {Sequential Pattern Mining to Discover Relations between Genes and Rare Diseases},
booktitle = {IEEE Int. Symp. on Computer-Based Medical Systems (CBMS)},
year = {2012},
pages = {1-6},
keywords = {data mining, sequential patterns, relationships, bioinformatics, rare disease, natural language processing}
}
-
Mireille Ducassé and Peggy Cellier.
The LogicalMulticriteriaSort ThinkLet: Logical Navigation for Fair and Fast Convergence in Multicriteria Group Decision Making.
In Adiel Teixeira de Almeida,
Danielle Costa Morais,
and Suzanna de França Dantas Daher, editors,
Proceedings of the Group Decision and Negotiation Conference,
pages 87-96,
May 2012.
Note: ISBN 978-85-415-0036-4.
Keyword(s): multicriteria decision,
logical information systems,
formal concept analysis.
Abstract: |
Information overload is a key issue in group decision. A heuristics, called ``take-the-best'', has been shown useful to face multicriteria decisions while reducing information overload: when making decisions people often take criteria in a predefined order, the first criterion which discriminates the alternatives at stake is used to make the decision. In order to rationalize group work, Briggs and de Vreede have proposed collaboration design patterns, called thinkLets. This article presents the LogicalMulticriteriaSort which can be seen as a generalization of the take-the-best heuristics. It also proposes to consider criteria one at the time but once a criterion has been found discriminating it is kept in a record, and the process is iterated. The thinkLet is supported by a GDSS, based on Logical Information Systems, which gives an instantaneous feedback of each micro decision and keeps tracks of all of the decisions taken so far. The LogicalMulticriteriaSort ThinkLet guarantees more fairness and speed than the ChauffeurSort thinkLet. It also avoids the need to give artificial values and weights to the criteria as opposed to the Multicriteria thinkLet. A successful test case is reported. |
@InProceedings{ducasse2012,
Author={Mireille Ducassé and Peggy Cellier},
Title={The {LogicalMulticriteriaSort} {ThinkLet}: Logical Navigation for Fair and Fast Convergence in Multicriteria Group Decision Making},
Pages={87-96},
BookTitle={Proceedings of the Group Decision and Negotiation Conference},
Year={2012},
Editor={Adiel Teixeira de Almeida and Danielle Costa Morais and Suzanna de França Dantas Daher},
Publisher={},
Month={May},
Note={ISBN 978-85-415-0036-4},
Keywords={multicriteria decision, logical information systems, formal concept analysis},
Abstract={ Information overload is a key issue in group decision. A heuristics, called ``take-the-best'', has been shown useful to face multicriteria decisions while reducing information overload: when making decisions people often take criteria in a predefined order, the first criterion which discriminates the alternatives at stake is used to make the decision. In order to rationalize group work, Briggs and de Vreede have proposed collaboration design patterns, called thinkLets. This article presents the LogicalMulticriteriaSort which can be seen as a generalization of the take-the-best heuristics. It also proposes to consider criteria one at the time but once a criterion has been found discriminating it is kept in a record, and the process is iterated. The thinkLet is supported by a GDSS, based on Logical Information Systems, which gives an instantaneous feedback of each micro decision and keeps tracks of all of the decisions taken so far. The LogicalMulticriteriaSort ThinkLet guarantees more fairness and speed than the ChauffeurSort thinkLet. It also avoids the need to give artificial values and weights to the criteria as opposed to the Multicriteria thinkLet. A successful test case is reported.},
}
-
Sébastien Ferré.
Extension du langage de requêtes LISQL pour la représentation et l'exploration d'expressions mathématiques en RDF.
In S. Szulman and J. Charlet, editors,
Journées francophones d'ingénierie des connaissances,
pages 285-300,
2012.
INSERM UMPC.
[WWW]
Keyword(s): LISQL,
query language,
mathematics,
RDF,
semantic web,
knowledge representation.
Abstract: |
Les expressions mathématiques comptent pour une part importante dans les connaissances humaines. Nous en proposons une représentation en RDF afin de pouvoir les intégrer aux autres connaissances dans le Web sémantique. Nous étendons ensuite le langage de description et d'interrogation LISQL afin de concilier des représentations non-ambiguës, des requêtes expressives et des notations naturelles et concises. Par exemple, la requête exttt{int(...?X $\hat{~}$ 2...,?X)} permet de trouver les intégrales en~$x$ dont le corps contient la sous-expression~$x^2$. Tout cela permet d'utiliser Sewelis, un système d'information logique pour le Web sémantique, pour la représentation et l'exploration guidée d'expressions mathématiques. Ce guidage dispense les utilisateurs de maîtriser la syntaxe de LISQL et le vocabulaire tout en leur garantissant des expressions bien formées et des résultats à leurs requêtes. |
@InProceedings{Fer2012ic,
author = {Sébastien Ferré},
title = {Extension du langage de requêtes {LISQL} pour la représentation et l'exploration d'expressions mathématiques en {RDF}},
booktitle = {Journées francophones d'ingénierie des connaissances},
pages = {285-300},
year = {2012},
editor = {S. Szulman and J. Charlet},
organization = {INSERM UMPC},
url = {http://ics.upmc.fr/},
isbn = {978-2-7466-4577-6},
keywords = {LISQL, query language, mathematics, RDF, semantic web, knowledge representation},
abstract = {Les expressions mathématiques comptent pour une part importante dans les connaissances humaines. Nous en proposons une représentation en RDF afin de pouvoir les intégrer aux autres connaissances dans le Web sémantique. Nous étendons ensuite le langage de description et d'interrogation LISQL afin de concilier des représentations non-ambiguës, des requêtes expressives et des notations naturelles et concises. Par exemple, la requête exttt{int(...?X $\hat{~}$ 2...,?X)} permet de trouver les intégrales en~$x$ dont le corps contient la sous-expression~$x^2$. Tout cela permet d'utiliser Sewelis, un système d'information logique pour le Web sémantique, pour la représentation et l'exploration guidée d'expressions mathématiques. Ce guidage dispense les utilisateurs de maîtriser la syntaxe de LISQL et le vocabulaire tout en leur garantissant des expressions bien formées et des résultats à leurs requêtes.},
}
-
Sébastien Ferré.
SQUALL: a Controlled Natural Language for Querying and Updating RDF Graphs.
In T. Kuhn and N.E. Fuchs, editors,
Controlled Natural Languages,
LNCS 7427,
pages 11-25,
2012.
Springer.
Keyword(s): query language,
update language,
Semantic Web,
RDF graphs,
SPARQL,
Montague grammars.
Abstract: |
Formal languages play a central role in the Semantic Web. An important aspect regarding their design is syntax as it plays a crucial role in the wide acceptance of the Semantic Web approach. The main advantage of controlled natural languages (CNL) is to reconcile the high-level and natural syntax of natural languages, and the precision and lack of ambiguity of formal languages. In the context of the Semantic Web and Linked Open Data, CNL could not only allow more people to contribute by abstracting from the low-level details, but also make experienced people more productive, and make the produced documents easier to share and maintain. We introduce SQUALL, a controlled natural language for querying and updating RDF graphs. It has a strong adequacy with RDF, an expressiveness close to SPARQL 1.1, and a CNL syntax that completely abstracts from low-level notions such as bindings and relational algebra. We formally define the syntax and semantics of SQUALL as a Montague grammar, and its translation to SPARQL. It features disjunction, negation, quantifiers, built-in predicates, aggregations with grouping, and n-ary relations through reification. |
@inproceedings{Fer2012cnl,
author = {Sébastien Ferré},
title = {{SQUALL}: a Controlled Natural Language for Querying and Updating {RDF} Graphs},
year = {2012},
pages = {11-25},
editor = {T. Kuhn and N.E. Fuchs},
booktitle = {Controlled Natural Languages},
publisher = {Springer},
series = {LNCS 7427},
keywords = {query language, update language, Semantic Web, RDF graphs, SPARQL, Montague grammars},
abstract = {Formal languages play a central role in the Semantic Web. An important aspect regarding their design is syntax as it plays a crucial role in the wide acceptance of the Semantic Web approach. The main advantage of controlled natural languages (CNL) is to reconcile the high-level and natural syntax of natural languages, and the precision and lack of ambiguity of formal languages. In the context of the Semantic Web and Linked Open Data, CNL could not only allow more people to contribute by abstracting from the low-level details, but also make experienced people more productive, and make the produced documents easier to share and maintain. We introduce SQUALL, a controlled natural language for querying and updating RDF graphs. It has a strong adequacy with RDF, an expressiveness close to SPARQL 1.1, and a CNL syntax that completely abstracts from low-level notions such as bindings and relational algebra. We formally define the syntax and semantics of SQUALL as a Montague grammar, and its translation to SPARQL. It features disjunction, negation, quantifiers, built-in predicates, aggregations with grouping, and n-ary relations through reification.},
}
-
Sébastien Ferré,
Pierre Allard,
and Olivier Ridoux.
Cubes of Concepts: Multi-dimensional Exploration of Multi-valued Contexts.
In F. Domenach,
D. I. Ignatov,
and J. Poelmans, editors,
Int. Conf. Formal Concept Analysis,
LNCS 7278,
pages 112-127,
2012.
Springer.
Keyword(s): formal concept analysis,
OLAP,
cubes of concepts,
multi-valued contexts.
Abstract: |
A number of information systems offer a limited exploration in that users can only navigate from one object to another object, e.g. navigating from folder to folder in file systems, or from page to page on the Web. An advantage of conceptual information systems is to provide navigation from concept to concept, and therefore from set of objects to set of objects. The main contribution of this paper is to push the exploration capability one step further, by providing navigation from set of concepts to set of concepts. Those sets of concepts are structured along a number of dimensions, thus forming a cube of concepts. We describe a number of representations of concepts, such as sets of objects, multisets of values, and aggregated values. We apply our approach to multi-valued contexts, which stand at an intermediate position between many-valued contexts and logical contexts. We explain how users can navigate from one cube of concepts to another. We show that this navigation includes and extends both conceptual navigation and OLAP operations on cubes. |
@inproceedings{FerAllRid2012icfca,
author = {Sébastien Ferré and Pierre Allard and Olivier Ridoux},
title = {Cubes of Concepts: Multi-dimensional Exploration of Multi-valued Contexts},
year = {2012},
pages = {112-127},
editor = {F. Domenach and D. I. Ignatov and J. Poelmans},
booktitle = {Int. Conf. Formal Concept Analysis},
publisher = {Springer},
series = {LNCS 7278},
isbn = {978-3-642-29891-2},
ee = {http://dx.doi.org/10.1007/978-3-642-29892-9},
keywords = {formal concept analysis, OLAP, cubes of concepts, multi-valued contexts},
abstract = {A number of information systems offer a limited exploration in that users can only navigate from one object to another object, e.g. navigating from folder to folder in file systems, or from page to page on the Web. An advantage of conceptual information systems is to provide navigation from concept to concept, and therefore from set of objects to set of objects. The main contribution of this paper is to push the exploration capability one step further, by providing navigation from set of concepts to set of concepts. Those sets of concepts are structured along a number of dimensions, thus forming a cube of concepts. We describe a number of representations of concepts, such as sets of objects, multisets of values, and aggregated values. We apply our approach to multi-valued contexts, which stand at an intermediate position between many-valued contexts and logical contexts. We explain how users can navigate from one cube of concepts to another. We show that this navigation includes and extends both conceptual navigation and OLAP operations on cubes.},
}
-
Sébastien Ferré and Sebastian Rudolph.
Advocatus Diaboli - Exploratory Enrichment of Ontologies with Negative Constraints.
In A. ten Teije et al., editor,
Int. Conf. Knowledge Engineering and Knowledge Management (EKAW),
LNAI 7603,
pages 42-56,
2012.
Springer.
Keyword(s): semantic web,
ontology,
exploratory search,
negative constraints,
possible world.
Abstract: |
With the persistent deployment of ontological specifications in practice and the increasing size of the deployed ontologies, methodologies for ontology engineering are becoming more and more important. In particular, the specification of negative constraints is often neglected by the human expert, whereas they are crucial for increasing an ontology's deductive potential. % We propose a novel, arguably cognitively advantageous methodology for identifying and adding missing negative constraints to an existing ontology. To this end, a domain expert navigates through the space of satisfiable class expressions with the aim of finding absurd ones, which then can be forbidden by adding a respective constraint to the ontology. % We give the formal foundations of our approach, provide an implementation, called Possible World Explorer (PEW) and illustrate its usability by describing prototypical navigation paths using the example of the well-known pizza ontology. |
@InProceedings{FerRud2012ekaw,
author = {Sébastien Ferré and Sebastian Rudolph},
title = {Advocatus Diaboli - Exploratory Enrichment of Ontologies with Negative Constraints},
booktitle = {Int. Conf. Knowledge Engineering and Knowledge Management (EKAW)},
pages = {42-56},
year = {2012},
editor = {A. ten Teije et al.},
series = {LNAI 7603},
publisher = {Springer},
keywords = {semantic web, ontology, exploratory search, negative constraints, possible world},
abstract = {With the persistent deployment of ontological specifications in practice and the increasing size of the deployed ontologies, methodologies for ontology engineering are becoming more and more important. In particular, the specification of negative constraints is often neglected by the human expert, whereas they are crucial for increasing an ontology's deductive potential. % We propose a novel, arguably cognitively advantageous methodology for identifying and adding missing negative constraints to an existing ontology. To this end, a domain expert navigates through the space of satisfiable class expressions with the aim of finding absurd ones, which then can be forbidden by adding a respective constraint to the ontology. % We give the formal foundations of our approach, provide an implementation, called Possible World Explorer (PEW) and illustrate its usability by describing prototypical navigation paths using the example of the well-known pizza ontology.},
}
-
Alice Hermann,
Sébastien Ferré,
and Mireille Ducassé.
Aide à la création d'objets dans une base RDF(S) avec des règles de relaxation.
In S. Szulman and J. Charlet, editors,
Journées francophones d'ingénierie des connaissances,
pages 301-316,
2012.
INSERM UMPC.
[WWW]
Keyword(s): RDF,
relaxation rules,
object creation,
user interaction.
Abstract: |
Quand un utilisateur crée un nouvel objet dans le Web s\'emantique, les outils existants n'exploitent ni les objets existants et leurs propri\'et\'es, ni les propri\'et\'es d\'ej\`a connues du nouvel objet. Nous proposons UTILIS, une m\'ethode d'aide \`a la cr\'eation de nouveaux objets. UTILIS cherche des objets similaires au nouvel objet en appliquant des r\`egles de relaxation \`a sa description. % Les propri\'et\'es des objets similaires servent de suggestions pour compl\'eter la description du nouvel objet. % Une \'etude utilisateur men\'ee avec des \'etudiants en master montre que les suggestions d'UTILIS ont \'et\'e utilis\'ees. Les utilisateurs ont trouv\'e les suggestions pertinentes : dans la plupart des cas, ils pouvaient trouver l'\'el\'ement recherch\'e dans les trois premiers ensembles de suggestions. De plus, ils les ont appr\'eci\'ees, car la majorit\'e souhaitent les avoir dans un \'editeur de donn\'ees du Web s\'emantique. |
@InProceedings{HerFerDuc2012ic,
author = {Alice Hermann and Sébastien Ferré and Mireille Ducassé },
title = {Aide à la création d'objets dans une base {RDF(S)} avec des règles de relaxation},
booktitle = {Journées francophones d'ingénierie des connaissances},
pages = {301-316},
year = {2012},
editor = {S. Szulman and J. Charlet},
organization = {INSERM UMPC},
url = {http://ics.upmc.fr/},
isbn = {978-2-7466-4577-6},
keywords = {RDF, relaxation rules, object creation, user interaction},
abstract = {Quand un utilisateur crée un nouvel objet dans le Web s\'emantique, les outils existants n'exploitent ni les objets existants et leurs propri\'et\'es, ni les propri\'et\'es d\'ej\`a connues du nouvel objet. Nous proposons UTILIS, une m\'ethode d'aide \`a la cr\'eation de nouveaux objets. UTILIS cherche des objets similaires au nouvel objet en appliquant des r\`egles de relaxation \`a sa description. % Les propri\'et\'es des objets similaires servent de suggestions pour compl\'eter la description du nouvel objet. % Une \'etude utilisateur men\'ee avec des \'etudiants en master montre que les suggestions d'UTILIS ont \'et\'e utilis\'ees. Les utilisateurs ont trouv\'e les suggestions pertinentes : dans la plupart des cas, ils pouvaient trouver l'\'el\'ement recherch\'e dans les trois premiers ensembles de suggestions. De plus, ils les ont appr\'eci\'ees, car la majorit\'e souhaitent les avoir dans un \'editeur de donn\'ees du Web s\'emantique.},
}
-
Alice Hermann,
Sébastien Ferré,
and Mireille Ducassé.
An Interactive Guidance Process Supporting Consistent Updates of RDFS Graphs.
In A. ten Teije et al., editor,
Int. Conf. Knowledge Engineering and Knowledge Management (EKAW),
LNAI 7603,
pages 185-199,
2012.
Springer.
Keyword(s): semantic web,
RDF,
update,
interactive guidance.
Abstract: |
With existing tools, when creating a new object in the Semantic Web, users benefit neither from existing objects and their properties, nor from the already known properties of the new object. % We propose UTILIS, an interactive process to help users add new objects. While creating a new object, relaxation rules are applied to its current description to find similar objects, whose properties serve as suggestions to expand the description. % A user study conducted on a group of master students shows that students, even the ones disconcerted by the unconventional interface, used UTILIS suggestions. In most cases, they could find the searched element in the first three sets of properties of similar objects. % Moreover, with UTILIS users did not create any duplicate whereas with the other tool used in the study more than half of them did. |
@InProceedings{HerFerDuc2012ekaw,
author = {Alice Hermann and Sébastien Ferré and Mireille Ducassé},
title = {An Interactive Guidance Process Supporting Consistent Updates of {RDFS} Graphs},
booktitle = {Int. Conf. Knowledge Engineering and Knowledge Management (EKAW)},
pages = {185-199},
year = {2012},
editor = {A. ten Teije et al.},
series = {LNAI 7603},
publisher = {Springer},
keywords = {semantic web, RDF, update, interactive guidance},
abstract = {With existing tools, when creating a new object in the Semantic Web, users benefit neither from existing objects and their properties, nor from the already known properties of the new object. % We propose UTILIS, an interactive process to help users add new objects. While creating a new object, relaxation rules are applied to its current description to find similar objects, whose properties serve as suggestions to expand the description. % A user study conducted on a group of master students shows that students, even the ones disconcerted by the unconventional interface, used UTILIS suggestions. In most cases, they could find the searched element in the first three sets of properties of similar objects. % Moreover, with UTILIS users did not create any duplicate whereas with the other tool used in the study more than half of them did.},
}
-
Alice Hermann,
Sébastien Ferré,
and Mireille Ducassé.
Guided Semantic Annotation of Comic Panels with Sewelis.
In A. ten Teije et al., editor,
Knowledge Engineering and Knowledge Management (EKAW),
LNCS 7603,
pages 430-433,
2012.
Springer.
Keyword(s): demo,
semantic web,
RDF,
update,
interactive guidance.
Abstract: |
UTILIS (Updating Through Interaction in Logical Information Systems), introduced in a research paper at EKAW'12, is an interactive process to help users create new objects in a RDF graph. While creating a new object, relaxation rules are applied to its current description to find similar objects, whose properties serve as suggestions to expand the description. UTILIS is implemented in Sewelis, a system that reconciles the expressiveness of querying languages (e.g., SPARQL), and the benefits of exploratory search found in faceted search. The same interaction principles are used for both exploration and creation of semantic data. We illustrate the UTILIS approach by applying Sewelis to the semantic annotation of comic panels, reusing the dataset that was used for a user evaluation. |
@inproceedings{HerFerDuc2012demo,
author = {Alice Hermann and Sébastien Ferré and Mireille Ducassé},
title = {Guided Semantic Annotation of Comic Panels with Sewelis},
booktitle = {Knowledge Engineering and Knowledge Management (EKAW)},
editor = {A. ten Teije et al.},
year = {2012},
publisher = {Springer},
series = {LNCS 7603},
pages = {430-433},
keywords = {demo, semantic web, RDF, update, interactive guidance},
abstract = {UTILIS (Updating Through Interaction in Logical Information Systems), introduced in a research paper at EKAW'12, is an interactive process to help users create new objects in a RDF graph. While creating a new object, relaxation rules are applied to its current description to find similar objects, whose properties serve as suggestions to expand the description. UTILIS is implemented in Sewelis, a system that reconciles the expressiveness of querying languages (e.g., SPARQL), and the benefits of exploratory search found in faceted search. The same interaction principles are used for both exploration and creation of semantic data. We illustrate the UTILIS approach by applying Sewelis to the semantic annotation of comic panels, reusing the dataset that was used for a user evaluation.},
}
-
Solen Quiniou,
Peggy Cellier,
Thierry Charnois,
and Dominique Legallois.
Fouille de données pour la stylistique : cas des motifs séquentiels émergents.
In Actes des Journées Internationales d'Analyse Statistique des Données Textuelles,
Liège, Belgique,
pages 821-833,
2012.
[WWW]
Keyword(s): data mining,
emerging sequential patterns,
stylistic,
linguistic pattern,
natural language processing.
Abstract: |
Dans cet article, nous pr{\'e}sentons une {\'e}tude sur l'utilisation de m{\'e}thodes de fouille de donn{\'e}es pour l'analyse stylistique - d'un point de vue linguistique - en consid{\'e}rant des motifs s{\'e}quentiels {\'e}mergents. Nous montrons tout d'abord que la fouille de motifs s{\'e}quentiels de mots en utilisant la contrainte gap permet d'obtenir de nouveaux patrons linguistiques pertinents par rapport aux patrons construits {\`a} partir de n-grammes. Nous {\'e}tudions ensuite l'utilisation de motifs s{\'e}quentiels d'itemsets pour produire des patrons linguistiques plus g{\'e}n{\'e}raux. Nous validons notre approche d'un point de vue quantitatif et d'un point de vue linguistique, en r{\'e}alisant des exp{\'e}rimentations sur trois corpus fran{\c c}ais correspondant {\`a} diff{\'e}rents genres de texte (la po{\'e}sie, les correspondances et les romans, respectivement). En consid{\'e}rant plus particuli{\`e}rement les textes po{\'e}tiques, nous montrons que les techniques de fouille de donn{\'e}es employ{\'e}es permettent d'identifier des patrons linguistiques caract{\'e}ristiques. |
@inproceedings{QCCL2012JADT,
hal_id = {hal-00675586},
url = {http://hal.archives-ouvertes.fr/hal-00675586},
title = {{Fouille de données pour la stylistique : cas des motifs séquentiels émergents}},
author = {Quiniou, Solen and Cellier, Peggy and Charnois, Thierry and Legallois, Dominique},
abstract = {{Dans cet article, nous pr{\'e}sentons une {\'e}tude sur l'utilisation de m{\'e}thodes de fouille de donn{\'e}es pour l'analyse stylistique - d'un point de vue linguistique - en consid{\'e}rant des motifs s{\'e}quentiels {\'e}mergents. Nous montrons tout d'abord que la fouille de motifs s{\'e}quentiels de mots en utilisant la contrainte gap permet d'obtenir de nouveaux patrons linguistiques pertinents par rapport aux patrons construits {\`a} partir de n-grammes. Nous {\'e}tudions ensuite l'utilisation de motifs s{\'e}quentiels d'itemsets pour produire des patrons linguistiques plus g{\'e}n{\'e}raux. Nous validons notre approche d'un point de vue quantitatif et d'un point de vue linguistique, en r{\'e}alisant des exp{\'e}rimentations sur trois corpus fran{\c c}ais correspondant {\`a} diff{\'e}rents genres de texte (la po{\'e}sie, les correspondances et les romans, respectivement). En consid{\'e}rant plus particuli{\`e}rement les textes po{\'e}tiques, nous montrons que les techniques de fouille de donn{\'e}es employ{\'e}es permettent d'identifier des patrons linguistiques caract{\'e}ristiques.}},
keywords = {data mining, emerging sequential patterns, stylistic, linguistic pattern, natural language processing},
language = {Fran{\c c}ais},
affiliation = {Centre de Recherches interlangues sur la signification en Contexte - CRISCO , Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen - GREYC , LIS - IRISA},
booktitle = {{Actes des Journ{\'e}es Internationales d'Analyse Statistique des Donn{\'e}es Textuelles}},
pages = {821-833},
address = {Li{\`e}ge, Belgique},
audience = {internationale },
year = {2012},
isbn = {978-2-9601246-0-6}
}
-
Solen Quiniou,
Peggy Cellier,
Thierry Charnois,
and Dominique Legallois.
Fouille de graphes sous contraintes linguistiques pour l'exploration de grands textes.
In Actes de la Conférence sur le Traitement Automatique des Langues Naturelles,
Grenoble, France,
pages 253-266,
2012.
[WWW]
Keyword(s): Graph Mining,
sentence networks,
textual analysis,
textual navigation,
natural language processing.
Abstract: |
Dans cet article, nous proposons une approche pour explorer des textes de taille importante en mettant en {\'e}vidence des sous-parties coh{\'e}rentes. Cette m{\'e}thode d'exploration s'appuie sur une repr{\'e}sentation en graphe du texte, en utilisant le mod{\`e}le linguistique de Hoey pour s{\'e}lectionner et apparier les phrases dans le graphe. Notre contribution porte sur l'utilisation de techniques de fouille de graphes sous contraintes pour extraire des sous-parties pertinentes du texte (c'est-{\`a}-dire des collections de sous-r{\'e}seaux phrastiques homog{\`e}nes). Nous avons r{\'e}alis{\'e} des exp{\'e}rimentations sur deux textes anglais de taille cons{\'e}quente pour montrer l'int{\'e}r{\^e}t de l'approche que nous proposons. |
@inproceedings{QCCLTALN12,
url = {http://hal.archives-ouvertes.fr/hal-00702606},
title = {{Fouille de graphes sous contraintes linguistiques pour l'exploration de grands textes}},
author = {Quiniou, Solen and Cellier, Peggy and Charnois, Thierry and Legallois, Dominique},
abstract = {{Dans cet article, nous proposons une approche pour explorer des textes de taille importante en mettant en {\'e}vidence des sous-parties coh{\'e}rentes. Cette m{\'e}thode d'exploration s'appuie sur une repr{\'e}sentation en graphe du texte, en utilisant le mod{\`e}le linguistique de Hoey pour s{\'e}lectionner et apparier les phrases dans le graphe. Notre contribution porte sur l'utilisation de techniques de fouille de graphes sous contraintes pour extraire des sous-parties pertinentes du texte (c'est-{\`a}-dire des collections de sous-r{\'e}seaux phrastiques homog{\`e}nes). Nous avons r{\'e}alis{\'e} des exp{\'e}rimentations sur deux textes anglais de taille cons{\'e}quente pour montrer l'int{\'e}r{\^e}t de l'approche que nous proposons.}},
keywords = {Graph Mining, sentence networks, textual analysis, textual navigation, natural language processing},
language = {Fran{\c c}ais},
affiliation = {Centre de Recherches interlangues sur la signification en Contexte - CRISCO , Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen - GREYC , LIS - IRISA},
booktitle = {{Actes de la Conf{\'e}rence sur le Traitement Automatique des Langues Naturelles}},
pages = {253-266},
address = {Grenoble, France},
audience = {nationale },
year = {2012}
}
-
Solen Quiniou,
Peggy Cellier,
Thierry Charnois,
and Dominique Legallois.
What About Sequential Data Mining Techniques to Identify Linguistic Patterns for Stylistics?.
In Alexander F. Gelbukh, editor,
Int. Conf. on Computational Linguistics and Intelligent Text Processing (CICLing),
volume 7181 of LNCS,
New Delhi, Inde,
pages 166-177,
March 2012.
Springer.
Keyword(s): data mining,
sequential patterns,
stylistic,
linguistic pattern,
natural language processing.
Abstract: |
In this paper, we study the use of data mining techniques for stylistic analysis, from a linguistic point of view, by considering emerging sequential patterns. First, we show that mining sequential patterns of words with gap constraints gives new relevant linguistic patterns with respect to patterns built on n-grams. Then, we investigate how sequential patterns of itemsets can provide more generic linguistic patterns. We validate our approach from a linguistic point of view by conducting experiments on three corpora of various types of French texts (Poetry, Letters, and Fictions). By considering more particularly poetic texts, we show that characteristic linguistic patterns can be identified using data mining techniques. We also discuss how to improve our proposed approach so that it can be used more efficiently for linguistic analyses. |
@inproceedings{QCCL12,
title = {{What About Sequential Data Mining Techniques to Identify Linguistic Patterns for Stylistics?}},
author = {Quiniou, Solen and Cellier, Peggy and Charnois, Thierry and Legallois, Dominique},
abstract = {{In this paper, we study the use of data mining techniques for stylistic analysis, from a linguistic point of view, by considering emerging sequential patterns. First, we show that mining sequential patterns of words with gap constraints gives new relevant linguistic patterns with respect to patterns built on n-grams. Then, we investigate how sequential patterns of itemsets can provide more generic linguistic patterns. We validate our approach from a linguistic point of view by conducting experiments on three corpora of various types of French texts (Poetry, Letters, and Fictions). By considering more particularly poetic texts, we show that characteristic linguistic patterns can be identified using data mining techniques. We also discuss how to improve our proposed approach so that it can be used more efficiently for linguistic analyses.}},
language = {Anglais},
affiliation = {Centre de Recherches interlangues sur la signification en Contexte - CRISCO , Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen - GREYC , LIS - IRISA},
booktitle = {Int. Conf. on Computational Linguistics and Intelligent Text Processing (CICLing)},
pages = {166-177},
address = {New Delhi, Inde},
audience = {internationale },
year = {2012},
month = Mar,
isbn = {978-3-642-28603-2},
publisher = {Springer},
series = {LNCS},
volume = {7181},
keywords = {data mining, sequential patterns, stylistic, linguistic pattern, natural language processing},
editor = {Alexander F. Gelbukh},
}