Home
Last parution
Authors
Topics
Keywords
Parutions
Videos
Search
Reading committee
Contact
Subscription
Article submission
 
French version
French flag


The issues from
1 to 148 are also available on line at
NUMDAM

and at Revues.org
for the following issues
Modify search criterions
Results n° 1 to 8 of 75 matches
Page 1 . 2 . 3 . 4 . 5 . 6 . 7 . 8 . 9 . 10 . >> Next page
Title Text formal reductions for tree analysis and automatic classification. Application to a latin historians corpus
Author MELLET Sylvie, LUONG Nguyen Xuan, LONGREE Dominique, BARTHELEMY Jean-Pierre
Keywords Generic classification, Lattice, Linear textual structures, Motif (pattern), Neighbourhood, Texts topological approach, Tree analysis
Topics Classification - Clustering - Partitioning, Lattices, Literature, Trees
Abstract In this paper, we present different methods of automatic classification applied to a corpus of literary texts and we compare their different results; in particular we evaluate how each of them is suitable for exhibiting the generic classification of the corpus. We demonstrate that a topological approach of the texts which takes into account their linearity, i.e. the order of their micro- and macro-structures, results in better clustering than traditional quantitative methods which leave generally out of count this linear structure.
Number 187, Fall 2009, special issue: 2007 Meeting of the French-speaking Society of Classification
Language   French
Read the article


Title Projective operations on relatinal constraints
Author BURIGANA Luigi
Keywords Constraint, Expressive power, Projection, Relation
Topics Lattices, Logic, Psychology
Abstract Given a set of variables and a set of values, by a (relational) constraint we mean any set of functions from the former to the latter. Two special operations on constraints are considered, called existential and universal projections, because of their similarity with existential and universal quantifiers in a predicate calculus. The expressive power of both operations is explored, i.e., the general properties of the variety of constraints which may be produced starting from some initial constraint and applying those operations one or more times. A few comments are added concerning the expressive power of a larger system, comprising projective and Boolean operations (i.e., complementation, union and intersection) on constraints.
Number 181, Spring 2008
Language  English
Read the article


Title About the choice of the partner in aïkido: elements of algebra and combinatorics of the pairing of a finite set
Author BARBUT Marc, DUPREZ Jean-Marie
Keywords Aïkido, Configuration, Homogeneity, Lattice, Pairing, Probability
Topics Combinatorics, Lattices, Probabilities, Recurrence equations, Social Psychology, Sociology
Abstract The rules of the game named aïkido provide a particular occurrence of the following general problem: a finite set E(|E|= 2n) of persons is divided into k given classes (partition Π); each person is allowed to choose freely a partner among the others; the result is a second partition of E, into n 2-subsets; we name it pairing. The sequence of the sizes of the classes of the cut (infimum) of Π and a pairing (in the partitions lattice of E) is called here a configuration. This paper studies the set of all possible configurations in the two elementary cases k = 2 and k = 3. For (k ≥ 4), some general properties are showed.
Number 177, Spring 2007
Language   French
Read the article


Title Dialectical boundaries
Author DUGOWSON Stéphane
Keywords Category, Fuzzy, Graph, Lattice, Pretopology, Topology
Topics Graphs, Lattices, Logic, Topology
Abstract The aim of this paper is to propose, under the generic term of dialectical boundaries, a generalization of the concept of boundary, better suited to discrete spaces than the classical topological one. We shall consider first the case of crisp spaces then, after recalling the recent works about the formalization of fuzzy boundaries, we propose a partial typology of the various definitions that they contain, based on the concepts of fuzzy dialectical spaces and of spaces with fuzzy boundaries.
Number 177, Spring 2007
Language   French
Read the article


Title Structuring probabilistic data by Galois lattices
Author BRITO Paula, POLAILLON Géraldine
Keywords Conceptual clustering, Galois lattice, Probabilistic data
Topics Algorithms - Algorithmic Theory, Data Analysis, Lattices, Orders and preorders, Probabilities
Abstract In this paper we address the problem of organising probabilistic data by Galois concept lattices. Two lattices are proposed, the union lattice and the intersection lattice, corresponding to two distinct semantics, by choosing accordingly the join and meet operators. A new algorithm is proposed to construct the concept lattice. Two real data examples illustrate the presented approach.
Number 169, Spring 2005
Language  English
Read the article


Title A model of paleolithic man cognitive abilities
Author SAILLOT Isabelle, PATOU-MATHIS Marylène, RICHARD Jean-François, SANDER Emmanuel, POITRENAUD Sébastien
Keywords Categorization, Experimental paleo-psychology, Paleolithic behaviour
Topics Cognitive Sciences, Data Analysis, Lattices, Networks, Orders and preorders, Prehistory, Psychology
Abstract As far as paleolithic cognitive processes are concerned, most studies define their own vocabulary and method, usually using current words while ascribing them various meanings. No debate can hence be fruitfull. We suggest an alternative approach which is to address the numerous and accurate concepts developped since about fourty years by cognitive psychology and especially its experimental branch. Cognitive psychology of goal oriented actions is in fact a powerful tool provider in the attempt to understand and modelize paleolithic men behaviour and cognitive abilities. Here we show why and how it is possible to use these tools initially developped to investigate modern man cognition in the laboratory conditions. We claim that the cognitive psychology method presented in this article allows to draw a rigorous description of mental organization, especially about the complex cognitive process of memory and categorization, whatever human species is dealt with and wathever paleolithic period is concerned. A preliminary result concerning the Magdalenian level of the Tournal cave is produced and discussed.
Number 159, Fall 2002
Language   French
Read the article


Title Mean according to a composition law
Author ANTOINE Charles
Keywords Compatibility, Idempotence law, Lattice, Magma, n-ary application, Order isomorphism
Topics Algebra, Lattices, Orders and preorders, Statistics
Abstract This article presents an algebraic model of the concept of mean, in the discontinuous and finite case, but not necessarily restricted to numerical calculation. The approach which has been used is strictly formal and axiomatic even though it is, of course, issued from empirical models i.e. Pythagorean means (type r classical means). In view of possible applications in the human sciences, there has been an attempt to break away from strict numerical data, without excluding them entirely. We have determined a process which is able to embody the concept of average, by minimizing the mathematical tools needed for its application. As a starting point for its construction, we have used only two notions, those of latice, and of composition law. The first notion enables us to formalize the idea of intermediate value and the second the idea of aggregation according to the criterion of constant ; we think that these two principles make up the very foundation of the theory of averages. We begin by studying the means which operate on two objects only. We set out a few elementary characteristics before proceeding with an examination of the obtention conditions. We then generalize to more than two objects by pointing out the barycentric characteristics and weighted means.
Number 151, Fall 2000
Language   French
Read the article


Title Multivariate Bayesian implicative analysis for a binary questionnaire: quasi-implications and simplified Galois lattice
Author BERNARD Jean-Marc, POITRENAUD Sébastien
Keywords Bayesian inference, Binary data, Boolean methods, Imprecise Dirichlet model, Imprecise probabilities, Multivariate implicative index
Topics Classification - Clustering - Partitioning, Lattices, Mathematical Statistics, Orders and preorders, Probabilities
Abstract We propose a new method for simplifying the Galois lattice associated to a binary questionnaire (n units classified according to q binary questions). The method consists in weakening the implications borne by the lattice into quasi-implications. At the descriptive level, the method involves a new measure for quasi-implications (the "multivariate implicative index") which satisfies some requirements of invariance by logical equivalence. At the inductive level, uncertainty about the patterns' true frequencies is expressed by an imprecise-Dirichlet model. This model is shown to have several advantages over the usual non-informative Bayesian approach based on a single Dirichlet prior, especially for the case where n is small in comparison to 2q. An important feature of the method is that it provides two implicative summaries, descriptive and inductive, which both constitute simplified versions of the initial Galois lattice.
Number 147, Fall 1999, special issue: Classification
Language   French
Read the article


Page 1 . 2 . 3 . 4 . 5 . 6 . 7 . 8 . 9 . 10 . >> Next page

Users rights :
Contrat Creative Commons
The entire journal is licensed under a Creative Commons license