Page 1

Displaying 1 – 7 of 7

Showing per page

Calculations of graded ill-known sets

Masahiro Inuiguchi (2014)

Kybernetika

To represent a set whose members are known partially, the graded ill-known set is proposed. In this paper, we investigate calculations of function values of graded ill-known sets. Because a graded ill-known set is characterized by a possibility distribution in the power set, the calculations of function values of graded ill-known sets are based on the extension principle but generally complex. To reduce the complexity, lower and upper approximations of a given graded ill-known set are used at the...

Comparing algorithms based on marginal problem

Otakar Kříž (2007)

Kybernetika

The paper deals with practical aspects of decision making under uncertainty on finite sets. The model is based on marginal problem. Numerical behaviour of 10 different algorithms is compared in form of a study case on the data from the field of rheumatology. (Five of the algorithms types were suggested by A. Perez.) The algorithms (expert systems, inference engines) are studied in different situations (combinations of parameters).

Comparison of two methods for approximation of probability distributions with prescribed marginals

Albert Pérez, Milan Studený (2007)

Kybernetika

Let P be a discrete multidimensional probability distribution over a finite set of variables N which is only partially specified by the requirement that it has prescribed given marginals { P A ; A 𝒮 } , where 𝒮 is a class of subsets of N with 𝒮 = N . The paper deals with the problem of approximating P on the basis of those given marginals. The divergence of an approximation P ^ from P is measured by the relative entropy H ( P | P ^ ) . Two methods for approximating P are compared. One of them uses formerly introduced concept of...

Completing an uncertainty criterion of classification.

Joaquín Abellán (2005)

Mathware and Soft Computing

We present a variation of a method of classification based in uncertainty on credal set. Similarly to its origin it use the imprecise Dirichlet model to create the credal set and the same uncertainty measures. It take into account sets of two variables to reduce the uncertainty and to seek the direct relations between the variables in the data base and the variable to be classified. The success are equivalent to the success of the first method except in those where there are a direct relations between...

Compositional models, Bayesian models and recursive factorization models

Francesco M. Malvestuto (2016)

Kybernetika

Compositional models are used to construct probability distributions from lower-order probability distributions. On the other hand, Bayesian models are used to represent probability distributions that factorize according to acyclic digraphs. We introduce a class of models, called recursive factorization models, to represent probability distributions that recursively factorize according to sequences of sets of variables, and prove that they have the same representation power as both compositional...

Computing with words with the use of inverse RDM models of membership functions

Andrzej Piegat, Marcin Pluciński (2015)

International Journal of Applied Mathematics and Computer Science

Computing with words is a way to artificial, human-like thinking. The paper shows some new possibilities of solving difficult problems of computing with words which are offered by relative-distance-measure RDM models of fuzzy membership functions. Such models are based on RDM interval arithmetic. The way of calculation with words was shown using a specific problem of flight delay formulated by Lotfi Zadeh. The problem seems easy at first sight, but according to the authors' knowledge it has not...

Currently displaying 1 – 7 of 7

Page 1