Learning Bayesian networks from data: An information-theory based approach

被引:465
作者
Cheng, J
Greiner, R
Kelly, J
Bell, D
Liu, WR
机构
[1] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2E8, Canada
[2] Univ Ulster, Fac Informat, Coleraine BT52 1SA, Londonderry, North Ireland
基金
加拿大自然科学与工程研究理事会;
关键词
Bayesian belief nets; learning; probabilistic model; knowledge discovery; data mining; conditional independence test; monotone DAG-faithful; information theory;
D O I
10.1016/S0004-3702(02)00191-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:43 / 90
页数:48
相关论文
共 57 条
[1]  
ACID S, 1996, P 6 INT C IPMU 96 GR
[2]  
ACID S, 1996, P 12 C UNC ART INT P
[3]  
Agresti A., 1990, Analysis of categorical data
[4]  
[Anonymous], 1993, LECT NOTES STAT
[5]  
[Anonymous], P 11 INT C UNC ART I
[6]  
[Anonymous], 2021, ACM T INTERACT INTEL, DOI DOI 10.1145/3387166
[7]  
BADSBERG J, 1992, COMPUTATION STAT, P251
[8]  
BEINLICH IA, 1989, P 2 EUR C ART INT ME, P247
[9]   A guide to the literature on learning probabilistic networks from data [J].
Buntine, W .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (02) :195-210
[10]  
Cheng J., 1997, P 6 INT C INF KNOWL