Efficient computation of marginal probabilities in multivalued causal inverted multiway trees given incomplete information

DOI10.1002/(SICI)1098-111X(199906)14:6%3C535::AID-INT1%3E3.0.CO;2-GMaRDI QIDQ4939636zbMATH OpenOpenAlexFDO

Authors Dawn E. Holmes, Paul C. Rhodes, Gerald R. Garside

Publication date 6 February 2000

Full work available at URL https://doi.org/10.1002/(sici)1098-111x(199906)14:6%3C535::aid-int1%3E3.0.co;2-g

zbMATH Keywords

multivalued causal inverted multiway trees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1423127
• Exact credal treatment of missing data
• ON FILLING-IN MISSING CONDITIONAL PROBABILITIES IN CAUSAL NETWORKS
• INDEPENDENCE IN COMPLETE AND INCOMPLETE CAUSAL NETWORKS UNDER MAXIMUM ENTROPY
• MAXIMISING ENTROPY TO DEDUCE AN INITIAL PROBABILITY DISTRIBUTION FOR A CAUSAL NETWORK

Cites work

• The Uncertain Reasoner's Companion

Cited in

(5)

• INDEPENDENCE IN COMPLETE AND INCOMPLETE CAUSAL NETWORKS UNDER MAXIMUM ENTROPY
• Maximum entropy and least square error minimizing procedures for estimating missing conditional probabilities in Bayesian networks
• ON FILLING-IN MISSING CONDITIONAL PROBABILITIES IN CAUSAL NETWORKS
• Non-impeding noisy-AND tree causal models over multi-valued variables
• Bayesian Networks: Theory and Philosophy

This page was built for publication: Efficient computation of marginal probabilities in multivalued causal inverted multiway trees given incomplete information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939636)