Efficient approximation of probability distributions with \(k\)-order decomposable models

DOI10.1016/j.ijar.2016.03.005zbMath1357.68180OpenAlexW2326605466MaRDI QIDQ282916

Aritz Pérez, Iñaki Inza, José A. Lozano

Publication date: 12 May 2016

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2016.03.005

zbMATH Keywords

approximating probability distributionsbounded clique sizeChow-Liu algorithmlearning decomposable modelsmaximum likelihood problem

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Cites Work

• Discovering a junction tree behind a Markov network by a greedy algorithm
• Maximum likelihood bounded tree-width Markov networks
• Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
• A New Method for Vertical Parallelisation of TAN Learning Based on Balanced Incomplete Block Designs
• Graphical Models with R
• Approximating discrete probability distributions with dependence trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item