Skip to Main Content
Bayesian Networks
book

Bayesian Networks

by Marco Scutari, Jean-Baptiste Denis
June 2014
Intermediate to advanced content levelIntermediate to advanced
241 pages
6h 20m
English
CRC Press
Content preview from Bayesian Networks
110 Bayesian Networks: With Examples in R
Algorithm 4.3 Sparse Candidate Algorithm
1. Choose a network structure G over V, usually (but not necessarily)
empty.
2. Repeat the following steps until convergence:
(a) restrict: select a set C
i
of candidate parents for each node
X
i
V, which must include the parents of X
i
in G;
(b) maximise: find the network structure G
that maximises
Score(G
) among the networks in which the parents of each
node X
i
are included in the corresponding set C
i
;
(c) set G = G
.
3. Return the DAG G.
tures in a wide variety of situations. The two b est-known members of this
family are the Sparse Candidate algorithm (SC) by Friedman et
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Practical Applications of Bayesian Reliability

Practical Applications of Bayesian Reliability

Yan Liu, Athula I. Abeyratne
Benefits of Bayesian Network Models

Benefits of Bayesian Network Models

Philippe Weber, Christophe Simon
Learning Bayesian Models with R

Learning Bayesian Models with R

Hari Manassery Koduvely

Publisher Resources

ISBN: 9781482225587