A Parallel Algorithm for Statistical Belief Refinement and Its Use in Causal Reasoning
Abstract
This paper presents a new approach to efficient parallel computation of statistical inferences. This approach involves two heuristics, highest impact first and highest impact remaining, which control the speed of convergence and error estimation for an algorithm that iteratively refines degrees of belief. When applied to causal reasoning, this algorithm provides a performance solution to the qualification problem. This algorithm has been implemented and tested by a program called HITEST, which runs on parallel hardware.
Cite
Text
Weber. "A Parallel Algorithm for Statistical Belief Refinement and Its Use in Causal Reasoning." International Joint Conference on Artificial Intelligence, 1989.Markdown
[Weber. "A Parallel Algorithm for Statistical Belief Refinement and Its Use in Causal Reasoning." International Joint Conference on Artificial Intelligence, 1989.](https://mlanthology.org/ijcai/1989/weber1989ijcai-parallel/)BibTeX
@inproceedings{weber1989ijcai-parallel,
title = {{A Parallel Algorithm for Statistical Belief Refinement and Its Use in Causal Reasoning}},
author = {Weber, Jay C.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1989},
pages = {900-905},
url = {https://mlanthology.org/ijcai/1989/weber1989ijcai-parallel/}
}