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

DOI<535::AID-INT1>3.0.CO;2-G 10.1002/(SICI)1098-111X(199906)14:6<535::AID-INT1>3.0.CO;2-GzbMath0953.68130OpenAlexW2150608413MaRDI QIDQ4939636

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

Publication date: 6 February 2000

Full work available at URL: https://doi.org/10.1002/(sici)1098-111x(199906)14:6<535::aid-int1>3.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)

Related Items (3)

ON FILLING-IN MISSING CONDITIONAL PROBABILITIES IN CAUSAL NETWORKS ⋮ Maximum entropy and least square error minimizing procedures for estimating missing conditional probabilities in Bayesian networks ⋮ INDEPENDENCE IN COMPLETE AND INCOMPLETE CAUSAL NETWORKS UNDER MAXIMUM ENTROPY

Cites Work

• The Uncertain Reasoner&#39;s Companion

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