Abstract
AbstractBayesian Networks (BNs) have become increasingly popular over the last few decades as a tool for reasoning under uncertainty in fields as diverse as medicine, biology, epidemiology, economics and the social sciences. This is especially true in real-world areas where we seek to answer complex questions based on hypothetical evidence to determine actions for intervention. However, determining the graphical structure of a BN remains a major challenge, especially when modelling a problem under causal assumptions. Solutions to this problem include the automated discovery of BN graphs from data, constructing them based on expert knowledge, or a combination of the two. This paper provides a comprehensive review of combinatoric algorithms proposed for learning BN structure from data, describing 74 algorithms including prototypical, well-established and state-of-the-art approaches. The basic approach of each algorithm is described in consistent terms, and the similarities and differences between them highlighted. Methods of evaluating algorithms and their comparative performance are discussed including the consistency of claims made in the literature. Approaches for dealing with data noise in real-world datasets and incorporating expert knowledge into the learning process are also covered.
Funder
Alan Turing Institute
Office of the Civil Service Commission
Engineering and Physical Sciences Research Council
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics
Reference219 articles.
1. Achterberg T, Berthold T, Koch T, Wolter K. C (2008) Constraint integer programming: A new approach to integrate CP and MIP. In: International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, Springer, Berlin, Heidelberg, pp 6–20
2. Akaike H (1974) A new look at the statistical model identification. IEEE Trans Autom Control 19(6):716–723
3. Aliferis CF, Tsamardinos I, Statnikov A (2003a) HITON: a novel Markov Blanket algorithm for optimal variable selection. In: AMIA annual symposium proceedings, vol. 2003a. American Medical Informatics Association, p 21
4. Aliferis CF, Tsamardinos I, Statnikov AR, Brown LE (2003b) Causal explorer: a causal probabilistic network learning toolkit for biomedical discovery. In: METMBS, vol 3, pp 371–376
5. Aliferis CF, Statnikov A, Tsamardinos I, Mani S, Koutsoukos XD (2010) Local causal and markov blanket induction for causal discovery and feature selection for classification part i: algorithms and empirical evaluation. J Mach Learn Res 11(1):171–234
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献