Maximum likelihood bounded tree-width Markov networks
- 1 January 2003
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 143 (1) , 123-138
- https://doi.org/10.1016/s0004-3702(02)00360-0
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Information geometry on hierarchy of probability distributionsIEEE Transactions on Information Theory, 2001
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Approximating discrete probability distributions with decomposable modelsIEEE Transactions on Systems, Man, and Cybernetics, 1991
- Graphical and Recursive Models for Contingency TablesBiometrika, 1983
- Approximating discrete probability distributions with dependence treesIEEE Transactions on Information Theory, 1968