arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.01023cs.AIcs.ITmath.DSmath.IT
收藏

基于最优因果熵原理的布尔网络和布尔函数的数据驱动学习(BoCSE)

Data-Driven Learning of Boolean Networks and Functions by Optimal Causation Entropy Principle (BoCSE)

Clarkson University(克拉克森大学);Clarkson Center for Complex Systems Science(克拉克森复杂系统科学中心)

Jie Sun, Abd AlRahman AlMomani, Erik Bollt

摘要:

布尔函数和网络通常用于复杂生物系统的建模和分析,这种范式与数据科学和决策的其他重要领域高度相关,例如医疗领域和金融行业。从数据中自动学习布尔网络和布尔函数是一项具有挑战性的任务,部分原因是要估计大量的未知数(包括网络的结构和函数),对于这些未知数,蛮力方法将是指数复杂的。在本文中,我们开发了一种新的信息理论方法,我们证明是显着比以前的方法更有效。基于最近开发的最佳因果熵原理(oCSE),我们证明可以正确地推断网络区分直接与间接连接,我们在这里开发了一个有效的算法,进一步推断一个布尔网络(包括其结构和功能)的基础上观察到的数据从节点上的不断发展的状态。我们称这种新的推理方法为布尔最优因果熵(BoCSE),我们将证明我们的方法在计算上是高效的,并且对噪声也有弹性。此外,它允许选择一组最好地解释该过程的特征,可以描述为网络布尔函数降阶模型的语句。我们强调我们的方法的特征选择在几个现实世界的例子:(1)泌尿系统疾病的诊断,(2)心脏SPECT诊断,(3)在游戏中的信息位置井字游戏,(4)贷款违约状态的风险因果关系分析。我们所提出的方法是有效的和高效的,在所有的例子。

英文摘要:

Boolean functions and networks are commonly used in the modeling and analysis of complex biological systems, and this paradigm is highly relevant in other important areas in data science and decision making, such as in the medical field and in the finance industry. Automated learning of a Boolean network and Boolean functions, from data, is a challenging task due in part to the large number of unknowns (including both the structure of the network and the functions) to be estimated, for which a brute force approach would be exponentially complex. In this paper we develop a new information theoretic methodology that we show to be significantly more efficient than previous approaches. Building on the recently developed optimal causation entropy principle (oCSE), that we proved can correctly infer networks distinguishing between direct versus indirect connections, we develop here an efficient algorithm that furthermore infers a Boolean network (including both its structure and function) based on data observed from the evolving states at nodes. We call this new inference method, Boolean optimal causation entropy (BoCSE), which we will show that our method is both computationally efficient and also resilient to noise. Furthermore, it allows for selection of a set of features that best explains the process, a statement that can be described as a networked Boolean function reduced order model. We highlight our method to the feature selection in several real-world examples: (1) diagnosis of urinary diseases, (2) Cardiac SPECT diagnosis, (3) informative positions in the game Tic-Tac-Toe, and (4) risk causality analysis of loans in default status. Our proposed method is effective and efficient in all examples.

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

↑