Isabelle Bournaud

Université Paris-Saclay · Humanities And Social Sciences

Accompanying first year students in the transition from high school to university is now a major concern for universities. This article presents a support program designed for first-year students at university. The program is based first on workshops whose aim is to help students question their working methods in order to fit academic requirements....

Depuis quelques années, la réussite des nouveaux publics étudiants questionne les pratiques enseignantes. Tenir compte dans la construction d'un enseignement des spécificités de ces étudiants en termes de profils et stratégies d'apprentissage, motivation, …, est un levier pour favoriser leur réussite. Encore faut-il avoir connaissance de ces spécif...

Propositionalization has recently received much attention in the ILP community as a mean to learn efficiently non-determinate concepts using adapted propositional algorithms. This paper proposes to extend such an approach to unsupervised learning from symbolic relational description. To help deal with the known combinatorial explosion of the number...

In the last ten years, several approaches for knowledge discovery in databases based upon the construction of a concept lattice have been developed. Most of them are dedicated to binary or propositional descriptions. This paper presents an approach to build a particular concept lattice, called the Generaliza- tion Space, for r elational description...

The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of most specific classes: the Generalization Space. It has applications in the field of data mining, knowledge indexation or knowledge acquisition. Efficient algorithms have be...

ions for Knowledge Organization of Relational Descriptions Isabelle Bournaud 1 , Mlanie Courtine 2 , Jean-Daniel Zucker 2 1 LRI, Universit Paris-Sud, Av. du Gnral de Gaulle, 91405 Orsay Cedex, France Isabelle.Bournaud@lri.fr 2 LIP6 -- Pole IA, Universit Paris VI, 4 place Jussieu, 75252 Paris Cedex, France {Melanie.Courtine, Jean-Daniel.Zucker}@lip6...

The goal of conceptual clustering is to construct a hierarchy of concepts which cluster objects based on their simil arities. Knowledge organization aims at generating the set of maximall y specific concepts for all possible classifications: the Generalization Space. Our research focuses on the organization of relational data represented using c on...

A key issue in learning from observations is to build a classification of given objects or situations. Conceptual clustering methods address this problem of recognizing regularities among as set of objects that have not been pre-classified, so as to organize them into a hierarchy of concepts. Early approaches have been limited to unstructured domai...

This article describes a novel application ofInductive Logic Programming (ILP) to the problem of data mining relational databases. The task addressed here consists in mining a relational database ofmore than 200,000 ground facts describing 6768 Chinese characters. Mining this relational database may be recast in an ILP setting, where the form ofthe...

In rule based, automated management systems, knowledge is represented explicitly as long as it is necessary for the functioning of the system. However, some knowledge which might be quite useful for maintenance purposes, remains implicit and disseminated in the rule base. We present an original approach for the discovery of such implicit knowledge,...

. Our study registers in the framework of the automatic construction of classifications. We tackle an issue which has been less explored, that of the discovery of classifications. To tackle this problem we have chosen to pursue and develop the works of Mineau in the domain of the organization of knowledge bases using generalization [20]. We propose...

This paper addresses the problem of the automatic building of classifications to organize knowledge. The goal is to generate the set of least general generalizations of the objects descriptions: the Generalization Space. An anytime algorithm to build conceptual classifications for complex objects (having sub-parts) represented as conceptual graphs...