INDEPENDENCE IN COMPLETE AND INCOMPLETE CAUSAL NETWORKS UNDER MAXIMUM ENTROPY

DOI10.1142/S0218488508005571zbMath1152.68643OpenAlexW1992446199MaRDI QIDQ5505729

Michael J. Markham

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1142/s0218488508005571

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cites Work

• A note on the inevitability of maximum entropy
• Characterizing the principle of minimum cross-entropy within a conditional-logical framework
• The Uncertain Reasoner's Companion
• Efficient computation of marginal probabilities in multivalued causal inverted multiway trees given incomplete information
• MAXIMISING ENTROPY TO DEDUCE AN INITIAL PROBABILITY DISTRIBUTION FOR A CAUSAL NETWORK
• A note on the infeasibility of some inference processes

This page was built for publication: INDEPENDENCE IN COMPLETE AND INCOMPLETE CAUSAL NETWORKS UNDER MAXIMUM ENTROPY