-
Guillaume Aucher,
Annie Foret,
JeanBaptiste Lenhof,
Olivier Ridoux,
Francois Schwarzentruber,
and al..
Principles for a judgement editor based on Multi-BDDs.
In MIning and REasoning with Legal texts at ICAIL, London,
2017.
[WWW]
Abstract: |
We describe the theoretical principles that underlie the design of a software tool which could be used by judges for writing judgements and for making decisions about litigations. The tool is based on Binary Decision Diagrams (BDD), which are graphical representations of truth-valued functions associated to propositional formulas. Given a specific litigation, the tool asks questions to the judge; each question is represented by a propositional atom. Their answers, true or false, allow to evaluate the truth value of the formula which encodes the overall recommendation of the software about the litigation. Our approach combines some sort of `theoretical' or `legal' reasoning dealing with the core of the litigation itself together with some sort of `procedural' reasoning dealing with the protocol that has to be followed by the judge during the trial: some questions or group of questions must necessarily be examined and sometimes in a specific order. That is why we consider extensions of BDDs called Multi-BDDs. They are BDDs with multiple entries corresponding to the different specific issues that must necessarily be addressed by the judge during the trial. We illustrate our ideas on a case study dealing with French union trade elections, an example that has been used throughout a project with the French Cour de cassation. We end the article by sketching the architecture of a prototype software that has been developed during this project. |
@inproceedings{Foret17b,
author={Guillaume Aucher and Annie Foret and Jean\-Baptiste Lenhof and Olivier Ridoux and Francois Schwarzentruber and al.},
title={Principles for a judgement editor based on Multi-BDDs},
url={http://www.mirelproject.eu/MIRELws/},
booktitle={MIning and REasoning with Legal texts at ICAIL, London},
year={2017},
abstract={We describe the theoretical principles that underlie the design of a software tool which could be used by judges for writing judgements and for making decisions about litigations. The tool is based on Binary Decision Diagrams (BDD), which are graphical representations of truth-valued functions associated to propositional formulas. Given a specific litigation, the tool asks questions to the judge; each question is represented by a propositional atom. Their answers, true or false, allow to evaluate the truth value of the formula which encodes the overall recommendation of the software about the litigation. Our approach combines some sort of `theoretical' or `legal' reasoning dealing with the core of the litigation itself together with some sort of `procedural' reasoning dealing with the protocol that has to be followed by the judge during the trial: some questions or group of questions must necessarily be examined and sometimes in a specific order. That is why we consider extensions of BDDs called Multi-BDDs. They are BDDs with multiple entries corresponding to the different specific issues that must necessarily be addressed by the judge during the trial. We illustrate our ideas on a case study dealing with French union trade elections, an example that has been used throughout a project with the French Cour de cassation. We end the article by sketching the architecture of a prototype software that has been developed during this project.},
}
-
Alexis Chauvet and Annie Foret.
Systèmes d'information pour les chercheurs en droit.
In Colloque CDN, Convergences du droit et du numérique, Bordeaux,
2017.
[WWW]
Abstract: |
(fr) Cette étude concerne les systèmes d'information en droit et propose un nouveau prototype. Nous discutons les systèmes d'information actuellement utilisés par les chercheurs en droit, en précisant leurs limites. Nous présentons les principes d'un nouveau prototype pour un meilleur système. Ce travail s'accompagne d'une première réalisation concrète, un système à facettes sémantiques, résultat de notre chaîne de traitement sur un ensemble de décisions du Conseil Constitutionnel. (en) This study concerns information systems in law and proposes a new prototype. We discuss the information systems currently used by legal researchers, including their limitations. We present the principles of a new prototype for a better system. This work is accompanied by a first concrete realization, a system with semantic facets, result of our processing chain on a set of decisions of the Constitutional Council. |
@inproceedings{Foret17d,
author={Alexis Chauvet and Annie Foret},
title={Systèmes d'information pour les chercheurs en droit},
booktitle= {Colloque CDN, Convergences du droit et du num\'erique, Bordeaux},
url={http://cdn.u-bordeaux.fr/Colloque-des-11-12-13-septembre-2017/r753.html},
year={2017},
abstract={(fr) Cette étude concerne les systèmes d'information en droit et propose un nouveau prototype. Nous discutons les systèmes d'information actuellement utilisés par les chercheurs en droit, en précisant leurs limites. Nous présentons les principes d'un nouveau prototype pour un meilleur système. Ce travail s'accompagne d'une première réalisation concrète, un système à facettes sémantiques, résultat de notre chaîne de traitement sur un ensemble de décisions du Conseil Constitutionnel. (en) This study concerns information systems in law and proposes a new prototype. We discuss the information systems currently used by legal researchers, including their limitations. We present the principles of a new prototype for a better system. This work is accompanied by a first concrete realization, a system with semantic facets, result of our processing chain on a set of decisions of the Constitutional Council. },
}
-
Fabien Chevalier and Sébastien Ferré.
Entering the Digital Customer Onboarding Era: How the Semantic Web Can Help.
In N. Nikitina,
D. Song,
A. Fokoue,
and P. Haase, editors,
Posters & Demonstrations and Industry Tracks at Int. Semantic Web Conf.,
volume 1963 of CEUR Workshop Proceedings,
2017.
CEUR-WS.org.
[PDF]
Keyword(s): semantic web.
@inproceedings{ChevalierFerre2017iswc,
author = {Fabien Chevalier and Sébastien Ferré},
title = {Entering the Digital Customer Onboarding Era: How the Semantic Web Can Help},
booktitle = {Posters {\&} Demonstrations and Industry Tracks at Int. Semantic Web Conf.},
editor = {N. Nikitina and D. Song and A. Fokoue and P. Haase},
year = {2017},
series = {{CEUR} Workshop Proceedings},
volume = {1963},
publisher = {CEUR-WS.org},
pdf = {http://ceur-ws.org/Vol-1963/paper476.pdf},
keywords = {semantic web},
}
-
Shridhar B. Dandin and Mireille Ducassé.
Compact Visualization of Database Tables: Experimenting with Cricket Players Data.
In 3rd International Conference on Communication System, Pilani, India, Short paper,
2017.
Abstract: |
Database information is in the form of tables, that is two-dimensional row/column display. For large databases, the tabular data is difficult to read at a time for the aggregated results. Online Analytical database Processing (OLAP) proposes mechanisms to display data in aggregated forms. A choropleth map is a thematic map in which areas are colored in proportion to the measurement of a statistical variable being displayed, such as population density. They are used mostly for compact graphical representation of geographical information. We propose a system that adapts choropleth maps and the OLAP cube to visualize tabular data in a compact way. Our proposal displays multidimensional data like OLAP Cube (a multidimensional data set also called as hyper cube), where we are mapping coloring of database table record based on two attributes $a$ (first dimension) and $b$ (second dimension), mapping varying-size circles based on attribute $c$ (third dimension), mapping numbers based on attribute $d$ (fourth dimension). We illustrate our approach on Cricket players data, namely on two linked tables 'Country' and 'Player'. They have a large number of rows and columns like 16 rows, 9 columns and 251 rows and 17 columns. The visualization presented by the system reduces the size of the table by a factor of about 4, allowing users to grasp more information at a time than the bare table display. |
@inproceedings{Dandin2017,
title={Compact Visualization of Database Tables: Experimenting with Cricket Players Data},
author={Dandin, Shridhar B. and Ducassé, Mireille},
booktitle={3rd International Conference on Communication System, Pilani, India, Short paper},
year={2017},
abstract = {Database information is in the form of tables, that is two-dimensional row/column display. For large databases, the tabular data is difficult to read at a time for the aggregated results. Online Analytical database Processing (OLAP) proposes mechanisms to display data in aggregated forms. A choropleth map is a thematic map in which areas are colored in proportion to the measurement of a statistical variable being displayed, such as population density. They are used mostly for compact graphical representation of geographical information. We propose a system that adapts choropleth maps and the OLAP cube to visualize tabular data in a compact way. Our proposal displays multidimensional data like OLAP Cube (a multidimensional data set also called as hyper cube), where we are mapping coloring of database table record based on two attributes $a$ (first dimension) and $b$ (second dimension), mapping varying-size circles based on attribute $c$ (third dimension), mapping numbers based on attribute $d$ (fourth dimension). We illustrate our approach on Cricket players data, namely on two linked tables 'Country' and 'Player'. They have a large number of rows and columns like 16 rows, 9 columns and 251 rows and 17 columns. The visualization presented by the system reduces the size of the table by a factor of about 4, allowing users to grasp more information at a time than the bare table display. }
}
-
Sébastien Ferré.
Concepts de plus proches voisins dans des graphes de connaissances.
In 28es Journées francophones d'Ingénierie des Connaissances (IC),
pages 163-174,
2017.
[WWW]
[PDF]
Keyword(s): semantic web,
knowledge graph,
nearest neighbours,
concept.
Abstract: |
Nous introduisons la notion de {\em concept de voisins} comme alternative à la notion de distance numérique dans le but d'identifier les objets les plus similaires à un objet requête, comme dans la méthode des plus proches voisins. Chaque concept de voisins est composé d'une intension qui décrit symboliquement ce que deux objets ont en commun et d'une extension qui englobe les objets qui se trouvent entre les deux. Nous définissons ces concepts de voisins pour des données complexes, les graphes de connaissances, où les n{\oe}uds jouent le rôle d'objets. Nous décrivons un algorithme {\em anytime} permettant d'affronter la complexité élevée de la tâche et nous présentons de premières expérimentations sur un graphe RDF de plus de 120.000 triplets. |
@inproceedings{Ferre2017ic,
title={Concepts de plus proches voisins dans des graphes de connaissances},
author={Sébastien Ferré},
booktitle={28es Journées francophones d'Ingénierie des Connaissances ({IC})},
pages={163--174},
year={2017},
pdf={https://hal.archives-ouvertes.fr/hal-01570277/file/paper\_cnn.pdf},
url={https://hal.archives-ouvertes.fr/hal-01570277},
keywords={semantic web, knowledge graph, nearest neighbours, concept},
abstract={Nous introduisons la notion de {\em concept de voisins} comme alternative à la notion de distance numérique dans le but d'identifier les objets les plus similaires à un objet requête, comme dans la méthode des plus proches voisins. Chaque concept de voisins est composé d'une intension qui décrit symboliquement ce que deux objets ont en commun et d'une extension qui englobe les objets qui se trouvent entre les deux. Nous définissons ces concepts de voisins pour des données complexes, les graphes de connaissances, où les n{\oe}uds jouent le rôle d'objets. Nous décrivons un algorithme {\em anytime} permettant d'affronter la complexité élevée de la tâche et nous présentons de premières expérimentations sur un graphe RDF de plus de 120.000 triplets.},
}
-
Annie Foret.
Traitement automatique des langues, données légales, systèmes d'information et logique.
In Atelier CDN, Convergences du droit et du numérique, Bordeaux,
2017.
[WWW]
Abstract: |
(fr) Nous proposons d'exploiter les données en utilisant les méthodes de l'analyse de concepts logiques [Ferré et Ridoux (2003)] via des outils de l'équipe LIS : Camelis http://www.irisa.fr/LIS/ferre/camelis/ ou Sparklis http://www.irisa.fr/LIS/ferre/sparklis/. Des expérimentations avec le système de gestion de contexte et le contexte obtenu permettront d'améliorer l'approche et la construction des facettes sémantiques à mettre en avant. (en) We propose to exploit the data using methods of logical concept analysis [Ferré and Ridoux (2003)] using LIS team tools: Camelis http://www.irisa.fr/LIS/ferre/camelis/ or Sparklis http://www.irisa.fr/LIS/ferre/sparklis/. Experiments with the context management system and the context obtained will allow to improve the approach and the construction of semantic facets to be put forward. |
@inproceedings{Foret17a,
author={Annie Foret},
title={Traitement automatique des langues, données l\'egales, syst\`emes d'information et logique},
booktitle={Atelier CDN, Convergences du droit et du num\'erique, Bordeaux},
year={2017},
url={http://cdn.u-bordeaux.fr/Contributions-recues/Annie-Foret-i1539.html},
abstract={ (fr) Nous proposons d'exploiter les données en utilisant les méthodes de l'analyse de concepts logiques [Ferré et Ridoux (2003)] via des outils de l'équipe LIS : Camelis http://www.irisa.fr/LIS/ferre/camelis/ ou Sparklis http://www.irisa.fr/LIS/ferre/sparklis/. Des expérimentations avec le système de gestion de contexte et le contexte obtenu permettront d'améliorer l'approche et la construction des facettes sémantiques à mettre en avant. (en) We propose to exploit the data using methods of logical concept analysis [Ferré and Ridoux (2003)] using LIS team tools: Camelis http://www.irisa.fr/LIS/ferre/camelis/ or Sparklis http://www.irisa.fr/LIS/ferre/sparklis/. Experiments with the context management system and the context obtained will allow to improve the approach and the construction of semantic facets to be put forward.},
}
-
Clément Gautrais,
Peggy Cellier,
René Quiniou,
and Alexandre Termier.
Topic Signatures in Political Campaign Speeches.
In ,
pages 2342-2347,
2017.
[WWW]
[doi:10.18653/v1/D17-1249]
@inproceedings{gautrais_topic_2017,
title = {Topic {Signatures} in {Political} {Campaign} {Speeches}},
url = {https://hal.archives-ouvertes.fr/hal-01640498},
doi = {10.18653/v1/D17-1249},
language = {en},
urldate = {2018-02-09},
journal = {Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing},
author = {Gautrais, Clément and Cellier, Peggy and Quiniou, René and Termier, Alexandre},
year = {2017},
pages = {2342--2347},
file = {Full Text PDF:/Users/cellier/Documents/1_Recherche/Biblio_Libraries/biblio_zotero/storage/EGUYPNQI/Gautrais et al. - 2017 - Topic Signatures in Political Campaign Speeches.pdf:application/pdf;Snapshot:/Users/cellier/Documents/1_Recherche/Biblio_Libraries/biblio_zotero/storage/X7KISKA6/d17-1249.html:text/html}
}
-
Clément Gautrais,
René Quiniou,
Peggy Cellier,
Thomas Guyet,
and Alexandre Termier.
Purchase Signatures of Retail Customers.
In Jinho Kim,
Kyuseok Shim,
Longbing Cao,
Jae-Gil Lee,
Xuemin Lin,
and Yang-Sae Moon, editors,
Advances in Knowledge Discovery and Data Mining,
Cham,
pages 110-121,
2017.
Springer International Publishing.
[WWW]
Abstract: |
In the retail context, there is an increasing need for understanding individual customer behavior in order to personalize marketing actions. We propose the novel concept of customer signature, that identifies a set of important products that the customer refills regularly. Both the set of products and the refilling time periods give new insights on the customer behavior. Our approach is inspired by methods from the domain of sequence segmentation, thus benefiting from efficient exact and approximate algorithms. Experiments on a real massive retail dataset show the interest of the signatures for understanding individual customers. |
@InProceedings{PAKDD17,
author="Gautrais, Cl{\'e}ment and Quiniou, Ren{\'e} and Cellier, Peggy and Guyet, Thomas and Termier, Alexandre",
editor="Kim, Jinho and Shim, Kyuseok and Cao, Longbing and Lee, Jae-Gil and Lin, Xuemin and Moon, Yang-Sae",
title="Purchase Signatures of Retail Customers",
booktitle="Advances in Knowledge Discovery and Data Mining",
year="2017",
publisher="Springer International Publishing",
address="Cham",
pages="110--121",
url={https://hal.archives-ouvertes.fr/hal-01639795},
abstract="In the retail context, there is an increasing need for understanding individual customer behavior in order to personalize marketing actions. We propose the novel concept of customer signature, that identifies a set of important products that the customer refills regularly. Both the set of products and the refilling time periods give new insights on the customer behavior. Our approach is inspired by methods from the domain of sequence segmentation, thus benefiting from efficient exact and approximate algorithms. Experiments on a real massive retail dataset show the interest of the signatures for understanding individual customers.",
isbn="978-3-319-57454-7"
}
-
Pierre Maillot,
Sébastien Ferré,
Peggy Cellier,
Mireille Ducassé,
and Franck Partouche.
Nested Forms with Dynamic Suggestions for Quality RDF Authoring.
In Int. Conf. Database and Expert Systems Applications (DEXA),
pages 35-45,
2017.
[WWW]
[doi:10.1007/978-3-319-64468-4_3]
Keyword(s): semantic web,
RDF,
knowledge acquisition,
form,
data quality.
@inproceedings{Formulis17dexa,
author = {Pierre Maillot and Sébastien Ferré and Peggy Cellier and Mireille Ducassé and Franck Partouche},
title = {Nested Forms with Dynamic Suggestions for Quality {RDF} Authoring},
booktitle = {Int. Conf. Database and Expert Systems Applications ({DEXA})},
pages = {35--45},
year = {2017},
doi = {10.1007/978-3-319-64468-4_3},
url = {https://hal.inria.fr/hal-01731124},
keywords = {semantic web, RDF, knowledge acquisition, form, data quality},
}