基于相关免疫数据的贝叶斯网络结构学习
Learning Bayesian Network Structure from Correlation-Immune Data
摘要:
搜索可能的贝叶斯网络的完整空间对于感兴趣的大小的问题来说是棘手的,因此贝叶斯网络结构学习算法,例如常用的稀疏候选算法,采用了启发式算法。然而,这些逻辑学也限制了只能从数据中学习的关系类型。他们无法学习表现出“相关免疫”的关系,例如奇偶性。为了在存在相关免疫关系的情况下学习贝叶斯网络,我们使用一种称为“偏斜”的技术扩展了稀疏候选算法。这种技术使用的观察,相关免疫的关系在一个特定的输入分布下可能不会相关免疫的另一个,充分不同的分布。我们表明,通过扩展稀疏候选人与这种技术,我们能够发现随机变量之间的关系,近似相关免疫,具有显着降低的计算成本比一次考虑多个父母的节点的替代方案。
英文摘要:
Searching the complete space of possible Bayesian networks is intractable for problems of interesting size, so Bayesian network structure learning algorithms, such as the commonly used Sparse Candidate algorithm, employ heuristics. However, these heuristics also restrict the types of relationships that can be learned exclusively from data. They are unable to learn relationships that exhibit "correlation-immunity", such as parity. To learn Bayesian networks in the presence of correlation-immune relationships, we extend the Sparse Candidate algorithm with a technique called "skewing". This technique uses the observation that relationships that are correlation-immune under a specific input distribution may not be correlation-immune under another, sufficiently different distribution. We show that by extending Sparse Candidate with this technique we are able to discover relationships between random variables that are approximately correlation-immune, with a significantly lower computational cost than the alternative of considering multiple parents of a node at a time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。