Counting Markov equivalence classes by number of immoralities
Two directed acyclic graphs (DAGs) are called Markov equivalent if and only if they have the same underlying undirected graph (i.e. skeleton) and the same set of immoralities. When using observational data alone and typical identifiability assumptions, such as faithfulness, a DAG model can only be d...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Uncertainty in Artificial Intelligence (AUAI)
2020
|
| Online Access: | https://hdl.handle.net/1721.1/125069 |