Reduction of Computational Complexity in Bayesian Networks through Removal of Weak Dependences
Author:
- Uffe KjærulffUKUffe Kjærulff
- 1 January 1994
- book chapter
- Published by Elsevier
- p. 374-382
Abstract
No abstract availableAll Related Versions
This publication has 7 references indexed in Scilit:
- Toward Normative Expert Systems: Part I The Pathfinder ProjectMethods of Information in Medicine, 1992
- Independence properties of directed markov fieldsNetworks, 1990
- Graphical Models for Associations between Variables, some of which are Qualitative and some QuantitativeThe Annals of Statistics, 1989
- Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1988
- Graphical and Recursive Models for Contingency TablesBiometrika, 1983
- Markov Fields and Log-Linear Interaction Models for Contingency TablesThe Annals of Statistics, 1980
- A lower bound for discrimination information in terms of variation (Corresp.)IEEE Transactions on Information Theory, 1967