Formulas for counting acyclic digraph Markov equivalence classes (Q2491863)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5028895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Formulas for counting acyclic digraph Markov equivalence classes |
scientific article; zbMATH DE number 5028895 |
Statements
Formulas for counting acyclic digraph Markov equivalence classes (English)
0 references
29 May 2006
0 references
ADG
0 references
Bayesian network
0 references
chordal graph
0 references
count
0 references
dag
0 references
essential graph
0 references
GMM
0 references
graphical Markov model
0 references
0.8476002812385559
0 references
0.8337968587875366
0 references
0.820451021194458
0 references
0.820451021194458
0 references
0.7871706485748291
0 references
