An algorithm for deciding if a set of observed independencies has a causal explanation
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Generating all the acyclic orientations of an undirected graph
Information Processing Letters
Learning Bayesian networks from data: an information-theory based approach
Artificial Intelligence
Equivalence and synthesis of causal models
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Learning equivalence classes of bayesian-network structures
The Journal of Machine Learning Research
Large-Sample Learning of Bayesian Networks is NP-Hard
The Journal of Machine Learning Research
Review: learning bayesian networks: Approaches and issues
The Knowledge Engineering Review
Hi-index | 0.00 |
Bayesian Networks is a popular tool for representing uncertainty knowledge in artificial intelligence fields. Learning BNs from data is helpful to understand the casual relation between the variable. But Learning BNs is a NP hard problem. This paper presents a novel hybrid algorithm for learning Markov Equivalence Classes, which combining dependency analysis and search-scoring approach together. The algorithm uses the constraint to perform a mapping from skeleton to MEC. Experiments show that the search space was constrained efficiently and the computational performance was improved.