A Review of Bayesian Networks and Structure Learning
Mathematica Applicanda, Tome 40 (2012) no. 1, pp. 51-103.

Voir la notice de l'article provenant de la source Annales Societatis Mathematicae Polonae Series

This article reviews the topic of Bayesian networks. A Bayesian network is a factorisation of a probability distribution along a directed acyclic graph. The relation between graphical d-separation and independence is described. A short article by Arthur Cayley (1853) [7] is discussed, which laid ideas later used in Bayesian networks: factorisation, the noisy `or' gate, applications of algebraic geometry to Bayesian networks. The ideas behind Pearl's intervention calculus when the DAG represents a causal dependence structure; the relation between the work of Cayley and Pearl is commented on.Most of the discussion is about structure learning, outlining the two main approaches; search and score versus constraint based. Constraint based algorithms often rely on the assumption of faithfulness, that the data to which the algorithm is applied is generated from distributions satisfying a faithfulness assumption where graphical d- separation and independence are equivalent. The article presents some considerations for constraint based algorithms based on recent data analysis, indicating a variety of situations where the faithfulness assumption does not hold.
DOI : 10.14708/ma.v40i1.278
Classification : 62H05, 68T37, 65S05
Mots-clés : Bayesian networks, directed acyclic graph, Arthur Cayley, intervention calculus, graphical Markov model, Markov equivalence, structure learning
@article{10_14708_ma_v40i1_278,
     author = {Timo J.T. Koski and John Noble},
     title = {A {Review} of {Bayesian} {Networks} and {Structure} {Learning}},
     journal = {Mathematica Applicanda},
     pages = { 51--103},
     publisher = {mathdoc},
     volume = {40},
     number = {1},
     year = {2012},
     doi = {10.14708/ma.v40i1.278},
     language = {pl},
     url = {http://geodesic.mathdoc.fr/articles/10.14708/ma.v40i1.278/}
}
TY  - JOUR
AU  - Timo J.T. Koski
AU  - John Noble
TI  - A Review of Bayesian Networks and Structure Learning
JO  - Mathematica Applicanda
PY  - 2012
SP  -  51
EP  - 103
VL  - 40
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.14708/ma.v40i1.278/
DO  - 10.14708/ma.v40i1.278
LA  - pl
ID  - 10_14708_ma_v40i1_278
ER  - 
%0 Journal Article
%A Timo J.T. Koski
%A John Noble
%T A Review of Bayesian Networks and Structure Learning
%J Mathematica Applicanda
%D 2012
%P  51-103
%V 40
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.14708/ma.v40i1.278/
%R 10.14708/ma.v40i1.278
%G pl
%F 10_14708_ma_v40i1_278
Timo J.T. Koski; John Noble. A Review of Bayesian Networks and Structure Learning. Mathematica Applicanda, Tome 40 (2012) no. 1, pp.  51-103. doi : 10.14708/ma.v40i1.278. http://geodesic.mathdoc.fr/articles/10.14708/ma.v40i1.278/

Cité par Sources :