arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.11543cs.LGcs.NAmath.NA
收藏

面向稀疏概率布尔网络构建的离散视角

A Discrete Perspective Towards the Construction of Sparse Probabilistic Boolean Networks

The University of Hong Kong(香港大学)

Christopher H. Fok, Chi-Wing Wong, Wai-Ki Ching

AI总结:

本文提出贪婪条目移除算法构建稀疏概率布尔网络,推导理论上界并首次研究下界,实验表明GER在合成和实际数据上优于现有算法,输出最稀疏分解。

摘要:

布尔网络(BN)及其扩展概率布尔网络(PBN)是研究基因调控网络的流行数学模型。BN和PBN也被应用于制造业系统、金融风险和医疗保健服务系统的建模。在本文中,我们提出了一种新颖的贪婪条目移除(GER)算法,用于构建稀疏PBN。我们为现有算法和GER算法推导了理论上界。此外,我们是首个研究稀疏PBN构建的下界问题,并推导出一系列相关理论结果。在我们基于合成数据和实际数据的数值实验中,GER在现有最先进的稀疏PBN构建算法中表现最佳,并在大多数测试的转移概率矩阵上输出了最稀疏的可能分解。

英文摘要:

Boolean Network (BN) and its extension Probabilistic Boolean Network (PBN) are popular mathematical models for studying genetic regulatory networks. BNs and PBNs are also applied to model manufacturing systems, financial risk and healthcare service systems. In this paper, we propose a novel Greedy Entry Removal (GER) algorithm for constructing sparse PBNs. We derive theoretical upper bounds for both existing algorithms and the GER algorithm. Furthermore, we are the first to study the lower bound problem of the construction of sparse PBNs, and to derive a series of related theoretical results. In our numerical experiments based on both synthetic and practical data, GER gives the best performance among state-of-the-art sparse PBN construction algorithms and outputs sparsest possible decompositions on most of the transition probability matrices being tested.

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

↑