A heuristic algorithm for pattern-to-DAG conversion

Authors:
Yingying Wen;Kevin B. Korb
Affiliations:
School of Information Technology, Monash University, Clayton, VIC, Australia;School of Information Technology, Monash University, Clayton, VIC, Australia
Venue:
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Year:
2007

Citing 5
Cited 0

Equivalence and synthesis of causal models

UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Bayesian Artificial Intelligence

Bayesian Artificial Intelligence
Learning equivalence classes of bayesian-network structures

The Journal of Machine Learning Research
Optimal structure identification with greedy search

The Journal of Machine Learning Research
The power of intervention

Minds and Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding a DAG to represent a Markov equivalence class of DAGs -- i.e., a pattern -- is a necessary step in some causal discovery algorithms. If the case involves a known true DAG generating artificial data, then it is also arguably a necessary step in evaluating any causal discovery algorithm. We present three algorithms for converting patterns to representative DAGs, analyse their time complexity and demonstrate their use experimentally.