Description Usage Arguments Value References See Also
Evaluates the log likelihood of an order, using the efficient decompostion used by Freidman and Koller (2003) (equation 8).
1 2 | logOrderLikelihood(order, numberOfNodes, nodesSeq,
scoresParents, parentsTables, allRows, rowsThatContain)
|
order |
A vector length |
numberOfNodes |
The number of nodes in the network. A numeric vector of length 1. |
nodesSeq |
The vector 1:nNodes(currentNetwork). (Supplied as an argument for possible speed gain) |
scoresParents |
A list of the form returned by
|
parentsTables |
A list of tables of the form
returned by |
allRows |
The vector 1:nrow(parentsTables). (Supplied as an argument for possible speed gain) |
rowsThatContain |
A list of the form created by
|
Returns the sampled network. A currentNetwork
object.
Friedman, N., & Koller, D. (2003). Being Bayesian about Network Structure. A Bayesian Approach to Structure Discovery in Bayesian Networks. Machine Learning, 50, 95-125. http://dx.doi.org/10.1023/A:1020249912095
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.