Discovering a junction tree behind a Markov network by a greedy algorithm

DOI10.1007/s11081-013-9232-8zbMath1294.65013arXiv1104.2762OpenAlexW1530670205MaRDI QIDQ402234

Edith Kovács, Tamás Szántai

Publication date: 27 August 2014

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.2762

zbMATH Keywords

greedy algorithmgraphical modelsconditional independencecontingency tableCherry tree probability distributionMarkov networktriangulated graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical optimization and variational techniques (65K10)

Related Items

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

Cites Work

• A microscopic study of minimum entropy search in learning decomposable Markov networks
• Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
• Probability Bounds with Cherry Trees
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Computing the Minimum Fill-In is NP-Complete
• Model Search among Multiplicative Models
• Analogies between Multiplicative Models in Contingency Tables and Covariance Selection
• Probability bounds given by hypercherry trees
• Approximating discrete probability distributions with dependence trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item