This is the authors' abstract. We don't add key points for this paper.
AbstractWe propose a method for the computational inference of directed acyclic graphical structures given data from experimental interventions. Order-space Markov chain Monte Carlo, equi-energy sampling, importance weighting, and stream-based computation are combined to create a fast algorithm for learning causal Bayesian network structures.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Ellis et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: