This paper addresses the classification problem with imperfect data. More precisely, it extends standard decision trees to handle uncertainty in both building and classification procedures. Uncertainty here is represented by means of possibility distributions. The first part investigates the issue of building decision trees from data with uncertain class values by developing a non-specificity b...

In real-world problems, input data may be pervaded with uncertainty. In this paper, we investigate the behavior of naive possibilistic classifiers, as a counterpart to naive Bayesian ones, for dealing with classification tasks in presence of uncertainty. For this purpose, we extend possibilistic classifiers, which have been recently adapted to numerical data, in order to cope with uncertainty i...

Clustering techniques have always been oriented to solve classification and pattern recognition problems. This clustering techniques have been used also to initialize the centers of the Radial Basis Function (RBF) when designing an RBF Neural Network (RBFNN) that approximates a function. Since classification and function approximation problems are quite different, it is necessary to design a ne...

Negotiation plays a key role as a means for sharing information and resources with the aim of looking for a common agreement. This paper proposes a new approach based on possibility theory, which integrates both the merits of argumentation-based negotiation and of heuristic methods looking for making trade-offs. Possibilistic logic is used as a unified setting, which proves to be convenient not...

In this paper we consider decision making under uncertainty when the probability of the states of nature is not known a priori and the outcomes of each alternative are characterized only approximately. The fuzzy approach is very useful to handle such situations. Here we take into consideration both the best and the worst consequences of a decision problem. An optimist expects the best to occur ...

We introduce a method for inducing the structure of (causal) possibilistic networks from databases of sample cases. In comparison to the construction of Bayesian belief networks, the proposed framework has some advantages, namely the explicit consideration of imprecise (set-valued) data, and the realization of a controlled form of information compression in order to increase the eeciency of the...

We present a new algorithm, called Optimist, which generates possibilistic setvalued rules from tables containing categorical attributes taking a finite number of values. An example of such a rule might be “IF HOUSEHOLDSIZE={Two OR Tree} AND OCCUPATION={Professional OR Clerical} THEN PAYMENT_METHOD={CashCheck (Max=249) OR DebitCard (Max=175)}. The algorithm is based on an original formal framew...

Possibilistic logic in general [7, 8, 9, 10] investigates how possibilistic uncertainty about propositions is propagated when making inferences in a formal logical system. In this paper, we look at a very particular aspect of possibilistic logic: we investigate how, under certain independence assumptions, the introduction of possibilistic uncertainty in classical propositional logic leads to th...

In the traditional treatment, risk situations are modeled by random variables. This paper focuses on risk situations described by fuzzy numbers. The goal of the paper is to define and characterize possibilistic risk aversion and study some of its indicators. Key–Words: Possibilistic risk aversion, possibilistic indicators

Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics (DLs) as an extension of description logics. We give semantics and syntax of possibilistic description logics. Two kinds of inference services are considered in our logics and algorithms are provided for them. These algorithms are imp...