activity
20082014
most citedImprecise Markov chains and their limit behaviour

77 citations · 111 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2014★ 6 cited

Sensitivity analysis for finite Markov chains in discrete time

Gert de Cooman, Filip Hermans, Erik Quaeghebeur

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 is done by considering as…

math.PR2012★ 28 cited

Accept & Reject Statement-Based Uncertainty Models

Erik Quaeghebeur, Gert de Cooman, Filip Hermans

We develop a framework for modelling and reasoning with uncertainty based on accept and reject statements about gambles. It generalises the frameworks found in the literature based…

cs.AI2010

Epistemic irrelevance in credal nets: the case of imprecise Markov trees

Gert de Cooman, Filip Hermans, Alessandro Antonucci +1

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 net…

math.PR2008

Imprecise probability trees: Bridging two theories of imprecise probability

Gert de Cooman, Filip Hermans

We give an overview of two approaches to probability theory where lower and upper probabilities, rather than probabilities, are used: Walley's behavioural theory of imprecise proba…

math.PR2008★ 77 cited

Imprecise Markov chains and their limit behaviour

Gert de Cooman, Filip Hermans, Erik Quaeghebeur

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 considerin…