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

树的鲁棒推理

Robust Inference of Trees

Marco Zaffalon, Marcus Hutter

摘要:

本文研究了未知分布生成数据的依赖结构的最优树逼近的可靠性推断问题。传统的处理方法是用互信息来度量随机变量之间的依赖强度。本文的可靠性是通过瓦利的不精确狄利克雷模型,它概括了贝叶斯学习与狄利克雷先验。采用不精确的Dirichlet模型的结果在后验区间期望的互信息,并在一组合理的树与数据一致。可靠的推理,实现了对实际树的子结构,重点是共同的所有似是而非的树。我们开发了一个精确的算法,在时间O(m^4)推断子结构,m是随机变量的数量。新算法被应用到一组从已知分布中采样的数据。该方法被证明是可靠的推断边缘的实际树,即使数据是非常稀缺的,不同于传统的方法。最后,在不精确Dirichlet模型下,给出了互信息的可信度上下限.这些使以前的发展被扩展到一个完整的推理方法的树木。

英文摘要:

This paper is concerned with the reliable inference of optimal tree-approximations to the dependency structure of an unknown distribution generating data. The traditional approach to the problem measures the dependency strength between random variables by the index called mutual information. In this paper reliability is achieved by Walley's imprecise Dirichlet model, which generalizes Bayesian learning with Dirichlet priors. Adopting the imprecise Dirichlet model results in posterior interval expectation for mutual information, and in a set of plausible trees consistent with the data. Reliable inference about the actual tree is achieved by focusing on the substructure common to all the plausible trees. We develop an exact algorithm that infers the substructure in time O(m^4), m being the number of random variables. The new algorithm is applied to a set of data sampled from a known distribution. The method is shown to reliably infer edges of the actual tree even when the data are very scarce, unlike the traditional approach. Finally, we provide lower and upper credibility limits for mutual information under the imprecise Dirichlet model. These enable the previous developments to be extended to a full inferential method for trees.

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

↑