Efficient approximation of probability distributions with k-order decomposable models

DOI10.1016/J.IJAR.2016.03.005MaRDI QIDQ282916zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Approximation of data by decomposable belief models
• Decomposition of Dirichlet processes and its applications
• Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions
• Decompounding discrete distributions: A nonparametric Bayesian approach
• scientific article; zbMATH DE number 3872489
• A backward selection procedure for approximating a discrete probability distribution by decomposable models
• Algorithm of exact computation of decomposable statistics distributions and its applications
• Complexity and asymptotically optimal algorithms for modeling of absolutely continuous distributions
• scientific article; zbMATH DE number 3954271

Cites work

• scientific article; zbMATH DE number 3845624 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• A backward selection procedure for approximating a discrete probability distribution by decomposable models
• A new method for vertical parallelisation of TAN learning based on balanced incomplete block designs
• Approximating discrete probability distributions with dependence trees
• Discovering a junction tree behind a Markov network by a greedy algorithm
• Graphical models with R.
• Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
• Learning Markov networks: Maximum bounded tree-width graphs
• Maximum likelihood bounded tree-width Markov networks
• Probabilistic graphical models.

Cited in

(2)

• Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming
• A backward selection procedure for approximating a discrete probability distribution by decomposable models

This page was built for publication: Efficient approximation of probability distributions with \(k\)-order decomposable models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282916)