Displaying similar documents to “Decision-making under uncertainty processed by lattice-valued possibilistic measures”

Approximations of lattice-valued possibilistic measures

Ivan Kramosil (2005)

Kybernetika

Similarity:

Lattice-valued possibilistic measures, conceived and developed in more detail by G. De Cooman in 1997 [2], enabled to apply the main ideas on which the real-valued possibilistic measures are founded also to the situations often occurring in the real world around, when the degrees of possibility, ascribed to various events charged by uncertainty, are comparable only quantitatively by the relations like “greater than” or “not smaller than”, including the particular cases when such degrees...

Optimal alternative robustness in Bayesian Decision Theory.

Fabrizio Ruggeri, Jacinto Martín, David Ríos Insua (2003)

RACSAM

Similarity:

In Martin et al (2003), we suggested an approach to general robustness studies in Bayesian Decision Theory and Inference, based on ε-contamination neighborhoods. In this note, we generalise the results considering neighborhoods based on norms, specifically, the supremum norm for utilities and the total variation norm for probability distributions. We provide tools to detect changes in preferences between alternatives under perturbations of the prior and/or the utility and the most sensitive...

Possibilistic alternatives of elementary notions and relations of the theory of belief functions

Ivan Kramosil (2001)

Kybernetika

Similarity:

The elementary notions and relations of the so called Dempster–Shafer theory, introducing belief functions as the basic numerical characteristic of uncertainty, are modified to the case when probabilistic measures and basic probability assignments are substituted by possibilistic measures and basic possibilistic assignments. It is shown that there exists a high degree of formal similarity between the probabilistic and the possibilistic approaches including the role of the possibilistic...

A model of decision with linguistic knowledge.

María Teresa Lamata Jiménez (1994)

Mathware and Soft Computing

Similarity:

The aim of this paper is to develop a new aggregating method for the decision problem in which the possible values of rewards are known in linguistic terms. We show new operators for solving this problem, as well as the way in which OWA operators provide us with an adequate framework for representing the optimism degree of the decision maker in case we have no information about the real state.

An incremental approach to obtaining attribute reduction for dynamic decision systems

Liu Wenjun (2016)

Open Mathematics

Similarity:

In the 1960s Professor Hu Guoding proposed a method of measuring information based on the idea that connotation and denotation of a concept satisfies inverse ratio rule. According to this information measure, firstly we put forward the information quantity for information systems and decision systems; then, we discuss the updating mechanism of information quantity for decision systems; finally, we give an attribute reduction algorithm for decision tables with dynamically varying attribute...

Classification systems and their lattice

Sándor Radeleczki (2002)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent...