The impact of prior knowledge on causal structure learning

被引:16
作者
Constantinou, Anthony C. [1 ]
Guo, Zhigao [1 ]
Kitson, Neville K. [1 ]
机构
[1] Queen Mary Univ London QMUL, Sch Elect Engn & Comp Sci, Bayesian Artificial Intelligence Res Lab, Machine Intelligence & Decis Syst MInDS Res Grp, London E1 4NS, England
基金
英国工程与自然科学研究理事会;
关键词
Bayesian networks; Causal discovery; Directed acyclic graphs; Domain knowledge; Knowledge-based constraints; Probabilistic graphical models; BAYESIAN NETWORKS; ALGORITHMS;
D O I
10.1007/s10115-023-01858-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Causal Bayesian networks have become a powerful technology for reasoning under uncertainty in areas that require transparency and explainability, by relying on causal assumptions that enable us to simulate hypothetical interventions. The graphical structure of such models can be estimated by structure learning algorithms, domain knowledge, or a combination of both. Various knowledge approaches have been proposed in the literature that enables us to specify prior knowledge that constrains or guides these algorithms. This paper introduces some novel, and also describes some existing, knowledge-based approaches that enable us to combine structure learning with knowledge obtained from heterogeneous sources. We investigate the impact of these approaches on structure learning across different algorithms, case studies and settings that we might encounter in practice. Each approach is assessed in terms of effectiveness and efficiency, including graphical accuracy, model fitting, complexity, and runtime; making this the first paper that provides a comparative evaluation of a wide range of knowledge approaches for structure learning. Because the value of knowledge depends on what data are available, we illustrate the results both with limited and big data. While the overall results show that knowledge becomes less important with big data due to higher learning accuracy rendering knowledge less important, some of the knowledge approaches are found to be more important with big data. Amongst the main conclusions is the observation that reduced search space obtained from knowledge does not always imply reduced computational complexity, perhaps because the relationships implied by the data and knowledge are in tension.
引用
收藏
页码:3385 / 3434
页数:50
相关论文
共 53 条
[1]   Exploiting Experts' Knowledge for Structure Learning of Bayesian Networks [J].
Amirkhani, Hossein ;
Rahmati, Mohammad ;
Lucas, Peter J. F. ;
Hommersom, Arjen .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2017, 39 (11) :2154-2170
[2]  
[Anonymous], 2000, Causality: models, reasoning and inference
[3]  
Bouchaert R, 1995, BAYESIAN BELIEF NETW
[4]  
Bouckaert R, 1994, P 10 C UNC ART INT S, P102
[5]   Time in Causal Structure Learning [J].
Bramley, Neil R. ;
Gerstenberg, Tobias ;
Mayrhofer, Ralf ;
Lagnado, David A. .
JOURNAL OF EXPERIMENTAL PSYCHOLOGY-LEARNING MEMORY AND COGNITION, 2018, 44 (12) :1880-1910
[6]   Formalizing Neurath's Ship: Approximate Algorithms for Online Causal Learning [J].
Bramley, Neil R. ;
Dayan, Peter ;
Griffiths, Thomas L. ;
Lagnado, David A. .
PSYCHOLOGICAL REVIEW, 2017, 124 (03) :301-338
[7]   A Method for Integrating Expert Knowledge When Learning Bayesian Networks From Data [J].
Cano, Andres ;
Masegosa, Andres R. ;
Moral, Serafin .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2011, 41 (05) :1382-1394
[8]   Priors on network structures. Biasing the search for Bayesian networks [J].
Castelo, R ;
Siebes, A .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2000, 24 (01) :39-57
[9]  
Center for Causal Discovery, TETR
[10]  
Center for Causal Discovery, 2019, TETR MAN