Inference with causal independence in the CPSC network

Authors:
Nevin Lianwen Zhang
Affiliations:
Dept. of Computer Science, University of Science & Technology, Hong Kong
Venue:
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Year:
1995

Citing 5
Cited 1

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Nonserial Dynamic Programming

Nonserial Dynamic Programming
d-Separation: From Theorems to Algorithms

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
A computational model for causal and diagnostic reasoning in inference systems

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1

Multiplicative factorization of noisy-max

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reports experiments with the causal independence inference algorithm proposed by Zhang and Poole (1994b) on the CPSC network created by Pradhan et al (1994). It is found that the algorithm is able to answer 420 of the 422 possible zero-observation queries, 94 of 100 randomly generated five-observation queries, 87 of 100 randomly generated ten-observation queries, and 69 of 100 randomly generated twenty-observation queries.