Learning Bayesian networks from data: An information-theory based approach
作者:
摘要
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop efficient algorithms that can effectively learn Bayesian networks, requiring only polynomial numbers of conditional independence (CI) tests in typical cases. We provide precise conditions that specify when these algorithms are guaranteed to be correct as well as empirical evidence (from real world applications and simulation tests) that demonstrates that these systems work efficiently and reliably in practice.
论文关键词:Bayesian belief nets,Learning,Probabilistic model,Knowledge discovery,Data mining,Conditional independence test,Monotone DAG-faithful,Information theory
论文评审过程:Received 20 September 2000, Revised 13 December 2001, Available online 12 March 2002.
论文官网地址:https://doi.org/10.1016/S0004-3702(02)00191-1