A method for updating that justifies minimum cross entropy

DOI10.1016/0888-613X(92)90022-RzbMath0779.68086MaRDI QIDQ1209526

Alena Vencovská, Jeffrey Bruce Paris

Publication date: 16 May 1993

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

conditioningupdatinginferenceminimum cross entropyinductive reasoning

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (9)

Soft evidential update for probabilistic multiagent systems ⋮ Logical perspectives on the foundations of probability ⋮ Rules of proof for maximal entropy inference ⋮ On the measurability of knowledge acquisition and query processing. ⋮ Invariant equivocation ⋮ ON FILLING-IN MISSING CONDITIONAL PROBABILITIES IN CAUSAL NETWORKS ⋮ ON THE STRUCTURE OF PROBABILITY FUNCTIONS IN THE NATURAL WORLD ⋮ A logic for inductive probabilistic reasoning ⋮ Proof systems for probabilistic uncertain reasoning

Cites Work

• Unnamed Item
• A note on the inevitability of maximum entropy
• On the applicability of maximum entropy to inexact reasoning
• A model of belief

This page was built for publication: A method for updating that justifies minimum cross entropy