2013
DOI: 10.1016/j.ins.2012.08.004
|View full text |Cite
|
Sign up to set email alerts
|

The effect of block parameter perturbations in Gaussian Bayesian networks: Sensitivity and robustness

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
14
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(14 citation statements)
references
References 21 publications
0
14
0
Order By: Relevance
“…Then, given this algebraic characterization, we demonstrate that one-way sensitivity methods defined for BNs can be generalized to single full CPT analyses for any model whose interpolating polynomial is multilinear, for example context-specific BNs [3] and stratified chain event graphs [12,39]. Because of both the lack of theoretical results justifying their use and the increase in computational complexity, multi-way methods have not been extensively discussed in the literature: see [2,7,21] for some exceptions. This paper aims at providing a comprehensive theoretical toolbox to start applying such analyses in practice.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Then, given this algebraic characterization, we demonstrate that one-way sensitivity methods defined for BNs can be generalized to single full CPT analyses for any model whose interpolating polynomial is multilinear, for example context-specific BNs [3] and stratified chain event graphs [12,39]. Because of both the lack of theoretical results justifying their use and the increase in computational complexity, multi-way methods have not been extensively discussed in the literature: see [2,7,21] for some exceptions. This paper aims at providing a comprehensive theoretical toolbox to start applying such analyses in practice.…”
Section: Introductionmentioning
confidence: 99%
“…[31] for a review), including the famous Kullback-Leibler (KL) divergence [28]. The application of KL distances in sensitivity analyses of BNs has been almost exclusively restricted to the case when the underlying distribution is assumed Gaussian [20,21], because in discrete BNs the computation of such a divergence requires more computational power than for CD distances. We demonstrate below that this additional complexity is a feature shared by any divergence in the family of φ-divergences.…”
Section: Introductionmentioning
confidence: 99%
“…The CD distance is used to quantify global changes by measuring how the overall distribution behaves when one (or more) parameter is varied. Likewise, SA approaches have been developed for continuous BBNs (mostly based on linear Gaussian regression) either based on computing partial derivatives (Castillo & Kjaerulff 2003) or based on the use of divergence measures (Gómez-Villegas et al, 2007), with generalisation to multi-way SA (Gómez-Villegas et al, 2013).…”
Section: Introductionmentioning
confidence: 99%
“…Although mathematically convenient for many problems, in complex systems modeling, independence assumption is not reasonable because much of the information is somehow encoded in the relations between the random variables [20,21]. In order to overcome this limitation, Markov Random Field (MRF) models appear as a natural generalization of the classical approach by the replacement of the independence assumption by a more realistic conditional independence assumption.…”
Section: Introductionmentioning
confidence: 99%