Abstract

SUMMARY A causal network is used in a number of areas as a depiction of patterns of ‘influence’ among sets of variables. In expert systems it is common to perform ‘inference’ by means of local computations on such large but sparse networks. In general, non-probabilistic methods are used to handle uncertainty when propagating the effects of evidence, and it has appeared that exact probabilistic methods are not computationally feasible. Motivated by an application in electromyography, we counter this claim by exploiting a range of local representations for the joint probability distribution, combined with topological changes to the original network termed ‘marrying’ and ‘filling-in‘. The resulting structure allows efficient algorithms for transfer between representations, providing rapid absorption and propagation of evidence. The scheme is first illustrated on a small, fictitious but challenging example, and the underlying theory and computational aspects are then discussed.

Keywords

ComputationGraphical modelComputer scienceExpert systemStatistical physicsTheoretical computer scienceAlgorithmArtificial intelligencePhysics

Affiliated Institutions

Related Publications

Publication Info

Year
1988
Type
article
Volume
50
Issue
2
Pages
157-194
Citations
3913
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

3913
OpenAlex
247
Influential
2198
CrossRef

Cite This

Steffen L. Lauritzen, David J. Spiegelhalter (1988). Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems. Journal of the Royal Statistical Society Series B (Statistical Methodology) , 50 (2) , 157-194. https://doi.org/10.1111/j.2517-6161.1988.tb01721.x

Identifiers

DOI
10.1111/j.2517-6161.1988.tb01721.x

Data Quality

Data completeness: 77%