-
G. M. Sacco and Sébastien Ferré.
Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience,
volume 25 of The Information Retrieval Series,
chapter 9 - Applications and Experiences,
pages 263-302.
Springer,
2009.
Keyword(s): dynamic taxonomies,
faceted search,
browsing,
information retrieval.
@InBook{Book-FIND:Chap9,
ALTeditor = {G. M. Sacco and Y. Tzitzikas},
title = {Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience},
author = {G. M. Sacco and Sébastien Ferré},
chapter = {9 - Applications and Experiences},
publisher = {Springer},
year = {2009},
series = {The Information Retrieval Series},
volume = {25},
pages = {263--302},
keywords = {dynamic taxonomies, faceted search, browsing, information retrieval},
}
-
G. M. Sacco and Sébastien Ferré.
Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience,
volume 25 of The Information Retrieval Series,
chapter 5 - Extensions to the Model,
pages 113-144.
Springer,
2009.
Keyword(s): dynamic taxonomies,
faceted search,
browsing,
information retrieval.
@InBook{Book-FIND:Chap5,
ALTeditor = {G. M. Sacco and Y. Tzitzikas},
title = {Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience},
author = {G. M. Sacco and Sébastien Ferré},
chapter = {5 - Extensions to the Model},
publisher = {Springer},
year = {2009},
series = {The Information Retrieval Series},
volume = {25},
pages = {113--144},
keywords = {dynamic taxonomies, faceted search, browsing, information retrieval},
}
-
G. M. Sacco,
Sébastien Ferré,
and Y. Tzitzikas.
Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience,
volume 25 of The Information Retrieval Series,
chapter 3 - Comparison with Other Techniques,
pages 35-74.
Springer,
2009.
Keyword(s): dynamic taxonomies,
faceted search,
browsing,
information retrieval.
@InBook{Book-FIND:Chap3,
ALTeditor = {G. M. Sacco and Y. Tzitzikas},
title = {Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience},
author = {G. M. Sacco and Sébastien Ferré and Y. Tzitzikas},
chapter = {3 - Comparison with Other Techniques},
publisher = {Springer},
year = {2009},
series = {The Information Retrieval Series},
volume = {25},
pages = {35--74},
keywords = {dynamic taxonomies, faceted search, browsing, information retrieval},
}
-
G. M. Sacco,
Y. Tzitzikas,
and Sébastien Ferré.
Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience,
volume 25 of The Information Retrieval Series,
chapter 8 - System Implementation,
pages 215-262.
Springer,
2009.
Keyword(s): dynamic taxonomies,
faceted search,
browsing,
information retrieval.
@InBook{Book-FIND:Chap8,
ALTeditor = {G. M. Sacco and Y. Tzitzikas},
title = {Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience},
author = {G. M. Sacco and Y. Tzitzikas and Sébastien Ferré},
chapter = {8 - System Implementation},
publisher = {Springer},
year = {2009},
series = {The Information Retrieval Series},
volume = {25},
pages = {215--262},
keywords = {dynamic taxonomies, faceted search, browsing, information retrieval},
}
-
M. Stefaner,
Sébastien Ferré,
S. Perugini,
J. Koren,
and Y. Zhang.
Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience,
volume 25 of The Information Retrieval Series,
chapter 4 - User Interface Design,
pages 75-112.
Springer,
2009.
Keyword(s): dynamic taxonomies,
faceted search,
browsing,
information retrieval.
@InBook{Book-FIND:Chap4,
ALTeditor = {G. M. Sacco and Y. Tzitzikas},
title = {Dynamic Taxonomies and Faceted Search: Theory, Practice, and Experience},
author = {M. Stefaner and Sébastien Ferré and S. Perugini and J. Koren and Y. Zhang},
chapter = {4 - User Interface Design},
publisher = {Springer},
year = {2009},
series = {The Information Retrieval Series},
volume = {25},
pages = {75--112},
keywords = {dynamic taxonomies, faceted search, browsing, information retrieval},
}
-
Sébastien Ferré.
Camelis: a logical information system to organize and browse a collection of documents.
Int. J. General Systems,
38(4):379-403,
2009.
Keyword(s): information retrieval,
browsing,
logical concept analysis,
annotation.
Abstract: |
Since the arrival of digital cameras, many people are faced to the challenge of organizing and browsing the overwhelming flood of photos their life produces. The same is true for all sorts of documents, e.g.~emails, audio files. Existing systems either let users fill query boxes without any assistance, or drive them through rigid navigation structures (e.g., hierarchies); or they do not let users put annotations on their documents, even when this would support the organization and retrieval of any documents on customized criteria. We present a tool, {\sc Camelis}, that offers users with an organization that is dynamically computed from documents and their annotations. {\sc Camelis} is designed along the lines of Logical Information Systems (LIS), which are founded on logical concept analysis. Hence, (1) an expressive language can be used to describe photos and query the collection, (2) manual and automatic annotations can be smoothly integrated, and (3) expressive querying and flexible navigation can be mixed in a same search and in any order. This presentation is illustrated on a real collection of more than 5,000 photos. |
@Article{Fer2009,
author = {Sébastien Ferré},
title = {Camelis: a logical information system to organize and browse a collection of documents},
journal = {Int. J. General Systems},
year = {2009},
volume = {38},
number = {4},
pages = {379-403},
keywords = {information retrieval, browsing, logical concept analysis, annotation},
abstract = {Since the arrival of digital cameras, many people are faced to the challenge of organizing and browsing the overwhelming flood of photos their life produces. The same is true for all sorts of documents, e.g.~emails, audio files. Existing systems either let users fill query boxes without any assistance, or drive them through rigid navigation structures (e.g., hierarchies); or they do not let users put annotations on their documents, even when this would support the organization and retrieval of any documents on customized criteria. We present a tool, {\sc Camelis}, that offers users with an organization that is dynamically computed from documents and their annotations. {\sc Camelis} is designed along the lines of Logical Information Systems (LIS), which are founded on logical concept analysis. Hence, (1) an expressive language can be used to describe photos and query the collection, (2) manual and automatic annotations can be smoothly integrated, and (3) expressive querying and flexible navigation can be mixed in a same search and in any order. This presentation is illustrated on a real collection of more than 5,000 photos.},
}
-
B. Morin,
Ludovic Mé,
Hervé Debar,
and Mireille Ducassé.
A Logic-based model to support alert correlation in intrusion detection.
Information Fusion,
10(4):285-299,
October 2009.
Keyword(s): Intrusion detection,
Alert correlation,
Data model.
Abstract: |
Managing and supervising security in large networks has become a challenging task, as new threats and flaws are being discovered on a daily basis. This requires an in depth and up-to-date knowledge of the context in which security-related events occur. Several tools have been proposed to support security operators in this task, each of which focuses on some specific aspects of the monitoring. Many alarm fusion and correlation approaches have also been investigated. However, most of these approaches suffer from two major drawbacks. First, they only take advantage of the information found in alerts, which is not sufficient to achieve the goals of alert correlation, that is to say to reduce the overall amount of alerts, while enhancing their semantics. Second, these techniques have been designed on an ad hoc basis and lack a shared data model that would allow them to reason about events in a cooperative way. In this paper, we propose a federative data model for security systems to query and assert knowledge about security incidents and the context in which they occur. This model constitutes a consistent and formal ground to represent information that is required to reason about complementary evidences, in order to confirm or invalidate alerts raised by intrusion detection systems. |
@Article{morin09,
Author={B. Morin and Ludovic Mé and Hervé Debar and Mireille Ducassé},
Title={A Logic-based model to support alert correlation in intrusion detection},
Pages={285-299},
Journal={Information Fusion},
Year={2009},
Volume={10},
Number={4},
Month={October},
Keywords={Intrusion detection, Alert correlation, Data model},
Abstract={ Managing and supervising security in large networks has become a challenging task, as new threats and flaws are being discovered on a daily basis. This requires an in depth and up-to-date knowledge of the context in which security-related events occur. Several tools have been proposed to support security operators in this task, each of which focuses on some specific aspects of the monitoring. Many alarm fusion and correlation approaches have also been investigated. However, most of these approaches suffer from two major drawbacks. First, they only take advantage of the information found in alerts, which is not sufficient to achieve the goals of alert correlation, that is to say to reduce the overall amount of alerts, while enhancing their semantics. Second, these techniques have been designed on an ad hoc basis and lack a shared data model that would allow them to reason about events in a cooperative way. In this paper, we propose a federative data model for security systems to query and assert knowledge about security incidents and the context in which they occur. This model constitutes a consistent and formal ground to represent information that is required to reason about complementary evidences, in order to confirm or invalidate alerts raised by intrusion detection systems.},
}
-
Denis Béchet and Annie Foret.
(PPQ) : a pregroup parser using majority composition.
In Proc. Parsing with Categorial Grammars, ESSLLI workshop, in Bordeaux, France,
2009.
[PDF]
Keyword(s): parser,
pregroups,
Lambek categorial grammars,
parsing software,
XML data.
Abstract: |
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalism like Lambek calculus but have a polynomial parsing algorithm. The paper presents a parser based on pregroup gram- mar that uses a tabular approach based on majority partial composition. |
@InProceedings{Foret09a,
author = {Denis Béchet and Annie Foret},
title = {({PPQ}) : a pregroup parser using majority composition},
booktitle = {Proc. Parsing with Categorial Grammars, ESSLLI workshop, in Bordeaux, France},
year = {2009},
pdf = {http://www.cs.toronto.edu/~tfowler/parsingwithcg/},
abstract={Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalism like Lambek calculus but have a polynomial parsing algorithm. The paper presents a parser based on pregroup gram- mar that uses a tabular approach based on majority partial composition. },
keywords={parser, pregroups, Lambek categorial grammars, parsing software, XML data},
}
-
Denis Béchet and Annie Foret.
Une boîte à outils pour développer et utiliser les grammaires de prégroupe.
In journée ATALA : Quels analyseurs syntaxiques pour le français ?,
2009.
[PDF]
Abstract: |
Pregroup grammars are a formalism in the spirit of categorial grammars and the Lambek calculus. In contrast to the latter, their parsing is polynomial. We present in this article a toolbox that contains a parser and a set of programs for the construction and use of grammars, in particular for French. |
@InProceedings{Foret09c,
author = {Denis Béchet and Annie Foret},
title = {Une boîte à outils pour développer et utiliser les grammaires de prégroupe},
booktitle = {journée {ATALA} : Quels analyseurs syntaxiques pour le français ?},
year = {2009},
pdf = {http://alpage.inria.fr/iwpt09/atala/bechet-foret.pdf},
keywords={},
Abstract={Pregroup grammars are a formalism in the spirit of categorial grammars and the Lambek calculus. In contrast to the latter, their parsing is polynomial. We present in this article a toolbox that contains a parser and a set of programs for the construction and use of grammars, in particular for French. }
}
-
Peggy Cellier,
Mireille Ducassé,
Sébastien Ferré,
and Olivier Ridoux.
DeLLIS: A Data Mining Process for Fault Localization.
In Int. Conf. Software Engineering (SEKE),
pages 432-437,
2009.
Knowledge Systems Institute Graduate School.
Keyword(s): data mining,
fault localization,
software.
@inproceedings{CDFR2009,
author = {Peggy Cellier and Mireille Ducassé and Sébastien Ferré and Olivier Ridoux},
title = {{DeLLIS}: A Data Mining Process for Fault Localization},
booktitle = {Int. Conf. Software Engineering ({SEKE})},
year = {2009},
pages = {432-437},
publisher = {Knowledge Systems Institute Graduate School},
keywords = {data mining, fault localization, software},
}
-
Mireille Ducassé.
(C)LP Tracing and Debugging.
In Patricia M. Hill and David Scott Warren, editors,
25th International Conference on Logic Programming, ICLP 2009,
volume 5649 of Lecture Notes in Computer Science,
pages 38,
July 2009.
Springer.
@inproceedings{ducasse09c,
author = {Mireille Ducassé},
title = {{(C)LP} Tracing and Debugging},
year = {2009},
pages = {38},
editor = {Patricia M. Hill and David Scott Warren},
booktitle = {25th International Conference on Logic Programming, ICLP 2009},
location = {Pasadena, CA, USA},
month = {July},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {5649},
year = {2009},
isbn = {978-3-642-02845-8},
}
-
Mireille Ducassé and Sébastien Ferré.
Aide à la décision multicritère : cohérence et équité grâce à l'analyse de concepts.
In Modèles et Apprentissage en Sciences Humaines et Sociales,
Juin 2009.
Keyword(s): Décision multicritère,
aide à la décision,
choix social,
analyse formelle de concepts,
systèmes d'information logiques,
étude de cas.
Abstract: |
De nombreuses décisions sont prises en commission, par exemple pour affecter des ressources. Les critères de décision sont difficiles à exprimer et la situation globale est en général trop complexe pour que les participants puissent l'appréhender pleinement. Dans cet article, nous décrivons un processus de décision où l'analyse de concepts est utilisée pour faire face à ces problèmes. Grâce à l'analyse de concepts, les personnes fair play ont la possibilité d'être équitables envers les candidats et de faire preuve de cohérence dans leurs jugements sur toute la durée de la réunion. |
@InProceedings{ducasse09b,
Author={Mireille Ducassé and Sébastien Ferré},
Title={Aide à la décision multicritère : cohérence et équité grâce à l'analyse de concepts},
BookTitle={Modèles et Apprentissage en Sciences Humaines et Sociales},
Year={2009},
Month={Juin},
Location={Toulouse},
Keywords={Décision multicritère, aide à la décision, choix social, analyse formelle de concepts, systèmes d'information logiques, étude de cas},
Abstract={De nombreuses décisions sont prises en commission, par exemple pour affecter des ressources. Les critères de décision sont difficiles à exprimer et la situation globale est en général trop complexe pour que les participants puissent l'appréhender pleinement. Dans cet article, nous décrivons un processus de décision où l'analyse de concepts est utilisée pour faire face à ces problèmes. Grâce à l'analyse de concepts, les personnes fair play ont la possibilité d'être équitables envers les candidats et de faire preuve de cohérence dans leurs jugements sur toute la durée de la réunion. },
}
-
Sébastien Ferré.
Efficient Browsing and Update of Complex Data Based on the Decomposition of Contexts.
In S. Rudolph,
F. Dau,
and S. O. Kuznetsov, editors,
Int. Conf. Conceptual Structures,
LNCS 5662,
pages 159-172,
2009.
Springer.
Keyword(s): software component,
logical concept analysis,
browsing,
update.
Abstract: |
Formal concept analysis is recognized as a good paradigm for browsing data sets. Besides browsing, update and complex data are other important aspects of information systems. To have an efficient implementation of concept-based information systems is difficult because of the diversity of complex data and the computation of conceptual structures, but essential for the scalability to real-world applications. We propose to decompose contexts into simpler and specialized components: logical context functors. We demonstrate this allows for scalable implementations, updatable ontologies, and richer navigation structures, while retaining genericity. |
@inproceedings{Fer2009b,
author = {Sébastien Ferré},
title = {Efficient Browsing and Update of Complex Data Based on the Decomposition of Contexts},
booktitle = {Int. Conf. Conceptual Structures},
year = {2009},
pages = {159-172},
editor = {S. Rudolph and F. Dau and S. O. Kuznetsov},
publisher = {Springer},
series = {LNCS 5662},
keywords = {software component, logical concept analysis, browsing, update},
abstract = {Formal concept analysis is recognized as a good paradigm for browsing data sets. Besides browsing, update and complex data are other important aspects of information systems. To have an efficient implementation of concept-based information systems is difficult because of the diversity of complex data and the computation of conceptual structures, but essential for the scalability to real-world applications. We propose to decompose contexts into simpler and specialized components: logical context functors. We demonstrate this allows for scalable implementations, updatable ontologies, and richer navigation structures, while retaining genericity.},
}