IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Bayesian networks from data: an information-theory based approach
Artificial Intelligence
Bayesian Networks for Data Mining
Data Mining and Knowledge Discovery
Learning equivalence classes of bayesian-network structures
The Journal of Machine Learning Research
Learning Bayesian Networks from Incomplete Data Based on EMI Method
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Time and sample efficient discovery of Markov blankets and direct causal relations
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Learning Bayesian networks from incomplete data with stochastic search algorithms
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
The Bayesian structural EM algorithm
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
On the geometry of Bayesian graphical models with hidden variables
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Hi-index | 0.00 |
Deterministic search algorithm such as greedy search is apt to get into local maxima, and learning Bayesian networks (BNs) by stochastic search strategy attracts the attention of many researchers. In this paper we propose a BN learning approach, E-MDL, based on stochastic search, which evolves BN structures with an evolutionary algorithm and can not only avoid getting into local maxima, but learn BNs with hidden variables. When there exists incomplete data, E-MDL estimates the probability distributions over the local structures in BNs from incomplete data, then evaluates BN structures by a variant of MDL score. The experimental results on Alarm, Asia and an examplar network verify the validation of E-MDL algorithm.