Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution

DOI10.1007/s10479-010-0814-yzbMath1261.60013OpenAlexW2089295672MaRDI QIDQ1931629

Tamás Szántai, Edith Kovács

Publication date: 15 January 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0814-y

zbMATH Keywords

dependence structurejunction treeMarkov networkdiscrete multivariate probability distribution

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial probability (60C05)

Related Items (3)

Efficient approximation of probability distributions with \(k\)-order decomposable models ⋮ Discovering a junction tree behind a Markov network by a greedy algorithm ⋮ Unnamed Item

Uses Software

• BENEDICT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• I-divergence geometry of probability distributions and minimization problems
• A new approach for learning belief networks using independence criteria
• Upper bounds for the probability of a union by multitrees
• Probability Bounds with Cherry Trees
• Bayesian Networks and Decision Graphs
• Probabilistic Networks and Expert Systems
• Probability bounds given by hypercherry trees
• Approximating discrete probability distributions with dependence trees

This page was built for publication: Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution