Learning Discretized Bayesian Networks with GOMEA

被引:0
作者
Ha, Damy M. F. [1 ]
Alderliesten, Tanja [1 ]
Bosman, Peter A. N. [2 ]
机构
[1] Leiden Univ, Radiotherapy, Med Ctr, Leiden, Netherlands
[2] Ctr Wiskunde & Informat, Evolutionary Intelligence, Amsterdam, Netherlands
来源
PARALLEL PROBLEM SOLVING FROM NATURE-PSN XVIII, PPSN 2024, PT III | 2024年 / 15150卷
基金
荷兰研究理事会;
关键词
Bayesian networks; Evolutionary Algorithms; Multi-objective Optimization; Explainable AI; Discretization; EVOLUTIONARY ALGORITHM;
D O I
10.1007/978-3-031-70071-2_22
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Bayesian networks model relationships between random variables under uncertainty and can be used to predict the likelihood of events and outcomes while incorporating observed evidence. From an eXplainable AI (XAI) perspective, such models are interesting as they tend to be compact. Moreover, captured relations can be directly inspected by domain experts. In practice, data is often real-valued. Unless assumptions of normality can be made, discretization is often required. The optimal discretization, however, depends on the relations modelled between the variables. This complicates learning Bayesian networks from data. For this reason, most literature focuses on learning conditional dependencies between sets of variables, called structure learning. In this work, we extend an existing state-of-the-art structure learning approach based on the Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) to jointly learn variable discretizations. The proposed Discretizing Bayesian Network GOMEA (DBN-GOMEA) obtains similar or better results than the current state-of-the-art when tasked to retrieve randomly generated ground-truth networks. Moreover, leveraging a key strength of evolutionary algorithms, we can straightforwardly perform DBN learning multi-objectively. We show how this enables incorporating expert knowledge in a uniquely insightful fashion, finding multiple DBNs that trade-off complexity, accuracy, and the difference with a pre-determined expert network.
引用
收藏
页码:352 / 368
页数:17
相关论文
共 29 条
  • [1] Exploiting Experts' Knowledge for Structure Learning of Bayesian Networks
    Amirkhani, Hossein
    Rahmati, Mohammad
    Lucas, Peter J. F.
    Hommersom, Arjen
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2017, 39 (11) : 2154 - 2170
  • [2] [Anonymous], 2011, Bayesian Statistics, DOI DOI 10.1093/ACPROF:OSO/9780199694587.003.0010
  • [3] A comparison of methods for discretizing continuous variables in Bayesian Networks
    Beuzen, Tomas
    Marshall, Lucy
    Splinter, Kristen D.
    [J]. ENVIRONMENTAL MODELLING & SOFTWARE, 2018, 108 : 61 - 66
  • [4] A Joint Python']Python/C plus plus Library for Efficient yet Accessible Black-Box and Gray-Box Optimization with GOMEA
    Bouter, Anton
    Bosman, Peter A. N.
    [J]. PROCEEDINGS OF THE 2023 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2023 COMPANION, 2023, : 1864 - 1872
  • [5] Exploiting Linkage Information in Real-Valued Optimization with the Real-Valued Gene-Pool Optimal Mixing Evolutionary Algorithm
    Bouter, Anton
    Alderliesten, Tanja
    Witteveen, Cees
    Bosman, Peter A. N.
    [J]. PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17), 2017, : 705 - 712
  • [6] MIxBN: library for learning Bayesian networks from mixed data
    Bubnova, Anna, V
    Deeva, Irina
    Kalyuzhnaya, Anna, V
    [J]. 10TH INTERNATIONAL YOUNG SCIENTISTS CONFERENCE IN COMPUTATIONAL SCIENCE (YSC2021), 2021, 193 : 494 - 503
  • [7] BUNTINE W, 1991, UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, P52
  • [8] Learning Discrete Bayesian Networks from Continuous Data
    Chen, Yi-Chun
    Wheeler, Tim A.
    Kochenderfer, Mykel J.
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 59 : 103 - 132
  • [9] de Campos L. M., 2011, Proceedings of the 2011 11th International Conference on Intelligent Systems Design and Applications (ISDA), P1200, DOI 10.1109/ISDA.2011.6121822
  • [10] FAYYAD UM, 1993, IJCAI-93, VOLS 1 AND 2, P1022