ON FILLING-IN MISSING CONDITIONAL PROBABILITIES IN CAUSAL NETWORKS

DOI10.1142/S021848850500345XzbMath1104.68107MaRDI QIDQ5692927

Jeffrey Bruce Paris

Publication date: 28 September 2005

Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

zbMATH Keywords

maximum entropymissing information

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Reasoning under uncertainty in the context of artificial intelligence (68T37) Measures of information, entropy (94A17)

Related Items (7)

Objective Bayesian Nets for Integrating Consistent Datasets ⋮ Logical perspectives on the foundations of probability ⋮ Rules of proof for maximal entropy inference ⋮ Using inductive reasoning for completing OCF-networks ⋮ Invariant equivocation ⋮ A note on irrelevance in inductive logic ⋮ Maximum entropy and least square error minimizing procedures for estimating missing conditional probabilities in Bayesian networks

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the inevitability of maximum entropy
• Causality and maximum entropy updating
• On the applicability of maximum entropy to inexact reasoning
• Papers on probability, statistics and statistical physics. Ed. by R. D. Rosenkrantz
• A method for updating that justifies minimum cross entropy
• Common sense and maximum entropy
• Bayesianism and language change
• ON THE STRUCTURE OF PROBABILITY FUNCTIONS IN THE NATURAL WORLD
• The Uncertain Reasoner's Companion
• Efficient computation of marginal probabilities in multivalued causal inverted multiway trees given incomplete information
• Prior Probabilities

This page was built for publication: ON FILLING-IN MISSING CONDITIONAL PROBABILITIES IN CAUSAL NETWORKS