arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.03248cs.AIcs.LGstat.ML
收藏

一种基于约束的连续时间贝叶斯网络结构学习算法

A Constraint-Based Algorithm for the Structural Learning of Continuous-Time Bayesian Networks

University of Milan-Bicocca(米兰比可卡大学);Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA)(达勒莫勒人工智能研究所(IDSIA))

Alessandro Bregoli, Marco Scutari, Fabio Stella

摘要:

动态贝叶斯网络在文献中作为离散时间模型得到了很好的研究:然而,它们的连续时间扩展相对较少受到关注。在本文中,我们提出了第一个基于约束的算法学习连续时间贝叶斯网络的结构。我们讨论了不同的统计检验和我们的建议,以建立条件独立性的基本假设。此外,我们分析和讨论的计算复杂性的最佳和最坏的情况下,所提出的算法。最后,我们使用合成数据验证其性能,并将其与Nodelman等人(2003)的基于分数的结构学习算法进行比较,讨论其优势和局限性。我们发现后者在学习二进制变量的网络时更准确,而我们基于约束的方法在变量假设超过两个值时更准确。数值实验证实,分数为基础的和基于约束的算法是可比的计算时间。

英文摘要:

Dynamic Bayesian networks have been well explored in the literature as discrete-time models: however, their continuous-time extensions have seen comparatively little attention. In this paper, we propose the first constraint-based algorithm for learning the structure of continuous-time Bayesian networks. We discuss the different statistical tests and the underlying hypotheses used by our proposal to establish conditional independence. Furthermore, we analyze and discuss the computational complexity of the best and worst cases for the proposed algorithm. Finally, we validate its performance using synthetic data, and we discuss its strengths and limitations comparing it with the score-based structure learning algorithm from Nodelman et al. (2003). We find the latter to be more accurate in learning networks with binary variables, while our constraint-based approach is more accurate with variables assuming more than two values. Numerical experiments confirm that score-based and constraint-based algorithms are comparable in terms of computation time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑