Robust Inference of Trees
<|reference_start|>Robust Inference of Trees: 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.<|reference_end|>
@article{zaffalon2005robust,
    title={Robust Inference of Trees},
    author={Marco Zaffalon and Marcus Hutter},
    journal={Annals of Mathematics and Artificial Intelligence, 45 (2005)
  215-239},
    year={2005},
    doi={10.1007/s10472-005-9007-9},
    number={IDSIA-11-03},
    archivePrefix={arXiv},
    eprint={cs/0511087},
    primaryClass={cs.LG cs.AI cs.IT math.IT}
}