Results 1  10
of
3,352
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
, 2010
"... We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal nets with the weaker notion of epistemic irrelevance, which is arguably more suited for a behavioural theory of probability ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal nets with the weaker notion of epistemic irrelevance, which is arguably more suited for a behavioural theory
Epistemic irrelevance in credal networks: the case of imprecise Markov trees
 IN ISIPTA ’09 – PROCEEDINGS OF THE SIXTH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITY
, 2009
"... We replace strong independence in credal networks with the weaker notion of epistemic irrelevance. Focusing on directed trees, we show how to combine local credal sets into a global model, and we use this to construct and justify an exact messagepassing algorithm that computes updated beliefs for a ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
We replace strong independence in credal networks with the weaker notion of epistemic irrelevance. Focusing on directed trees, we show how to combine local credal sets into a global model, and we use this to construct and justify an exact messagepassing algorithm that computes updated beliefs
On the Complexity of Strong and Epistemic Credal Networks
, 2013
"... Credal networks are graphbased statistical models whose parameters take values on a set, instead of being sharply specified as in traditional statistical models (e.g., Bayesian networks). The result of inferences with such models depends on the irrelevance/independence concept adopted. In this pape ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. In this paper, we study the computational complexity of inferences under the concepts of epistemic irrelevance and strong independence. We strengthen complexity results by showing that inferences with strong independence are NPhard even in credal trees with ternary variables, which indicates that tractable
Strategies of Discourse Comprehension
, 1983
"... El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacke ..."
Abstract

Cited by 601 (27 self)
 Add to MetaCart
El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacked coup deposed the reformist government of Col. Jacobo Arbenz Guzmán in 1954. Moderates of the political center. embattled but alive in E1 Salvador, have virtually disappeared in Guatemalajoining more than 30.000 victims of terror over the last tifteen vears. “The situation in Guatemala is much more serious than in EI Salvador, ” declares one Latin American diplomat. “The oligarchy is that much more reactionary. and the choices are far fewer. “ ‘Zero’: The Guatemalan oligarchs hated Jimmy Carter for cutting off U.S. military aid in 1977 to protest humanrights abusesand the rightwingers hired marimba bands and set off firecrackers on the night Ronald Reagan was elected. They considered Reagan an ideological kinsman and believed they had a special
What would we like to achieve and convey? CREDAL TREES UNDER IRRELEVANCE
, 2012
"... interpretation of the graphical structure recursive construction of the joint Credal trees under epistemic irrelevance Credal networks: the special case of a tree Basic concept Consider a directed tree T, with a variable Xt attached to each node t 2 T. ..."
Abstract
 Add to MetaCart
interpretation of the graphical structure recursive construction of the joint Credal trees under epistemic irrelevance Credal networks: the special case of a tree Basic concept Consider a directed tree T, with a variable Xt attached to each node t 2 T.
Imprecise markov chains and their limit behaviour
 Probability in the Engineering and Informational Sciences
"... ABSTRACT. When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This can be done by considering as basic uncertainty models the socalled credal sets that these probabilities are known or believed to belo ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
ABSTRACT. When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This can be done by considering as basic uncertainty models the socalled credal sets that these probabilities are known or believed
NEW DEVELOPMENTS IN CREDAL NETWORKS
"... A Bayesian network (see for instance [5]) is a special type of probabilistic graphical model that is intended to efficiently model information, and make inferences, about a number of uncertain variables Xk. Each of these variables is represented by a node in a directed acyclic graph, and to each suc ..."
Abstract
 Add to MetaCart
of probabilistic inferences about these variables. A credal network is a generalisation of a Bayesian network, where the local probability models are allowed to be imprecise: they can be convex closed sets of probability measures (also called credal sets), lower previsions, or sets of desirable gambles (see for
Multiple Model Tracking by Imprecise Markov Trees
"... Abstract – We present a new procedure for tracking manoeuvring objects by hidden Markov chains. It leads to more reliable modelling of the transitions between hidden states compared to similar approaches proposed within the Bayesian framework: we adopt convex sets of probability mass functions rathe ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract – We present a new procedure for tracking manoeuvring objects by hidden Markov chains. It leads to more reliable modelling of the transitions between hidden states compared to similar approaches proposed within the Bayesian framework: we adopt convex sets of probability mass functions
Graphoid properties of epistemic irrelevance and independence
, 2005
"... This paper investigates Walley’s concepts of epistemic irrelevance and epistemic independence for imprecise probability models. We study the mathematical properties of irrelevance and independence, and their relation to the graphoid axioms. Examples are given to show that epistemic irrelevance can v ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
This paper investigates Walley’s concepts of epistemic irrelevance and epistemic independence for imprecise probability models. We study the mathematical properties of irrelevance and independence, and their relation to the graphoid axioms. Examples are given to show that epistemic irrelevance can
Results 1  10
of
3,352