Robust inference of trees

DOI10.1007/s10472-005-9007-9zbMath1177.68217arXivcs/0511087OpenAlexW3098934517WikidataQ58012461 ScholiaQ58012461MaRDI QIDQ819944

Marco Zaffalon, Marcus Hutter

Publication date: 4 April 2006

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0511087

zbMATH Keywords

intervalsmutual informationgraphical modelsimprecise probabilitiesdependencerobust inferencespanning treesimprecise Dirichlet model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonparametric robustness (62G35) Measures of association (correlation, canonical correlation, etc.) (62H20) Trees (05C05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58)

Related Items (3)

An introduction to the imprecise Dirichlet model for multinomial data ⋮ Distribution of mutual information from complete and incomplete data ⋮ Practical robust estimators for the imprecise Dirichlet model

Uses Software

• BayesDA

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Distribution of mutual information from complete and incomplete data
• Bayesian network classifiers
• On the complexity of the robust spanning tree problem with interval data
• Exact credal treatment of missing data
• Partial identification of probability distributions.
• An introduction to the imprecise Dirichlet model for multinomial data
• A Benders decomposition approach for the robust spanning tree problem with interval data
• Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
• Interaction in multidimensional contingency tables: an information theoretic approach
• Approximating discrete probability distributions with dependence trees
• THE PRECISION OF OBSERVED VALUES OF SMALL FREQUENCIES
• On Information and Sufficiency
• An invariant form for the prior probability in estimation problems
• The robust spanning tree problem with interval data
• Robust learning with missing data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust inference of trees