Probabilistic graphical models follow directly from maximum entropy

MaRDI QIDQ5120612zbMATH OpenFDO

Authors Anh H. Ly, Francisco Zapata, Olac Fuentes, Vladik Kreinovich

Publication date 15 September 2020

Full work available at URL http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/3001

zbMATH Keywords

maximum entropyprobabilistic graphical models

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17)

Recommendations

• Graphical models, exponential families, and variational inference
• A note on the inevitability of maximum entropy
• Learning technique of probabilistic graphical models: a review
• scientific article; zbMATH DE number 1754720
• Probabilistic graphical models.

Cites work

• Computing statistics under interval and fuzzy uncertainty. Applications to computer science and engineering
• Probabilistic graphical models.
• Probability Theory

Cited in

(2)

• Chordal Graphs to Identify Graphical Model Solutions of Maximum of Entropy Under Constraints on Marginals
• Optimal regularizations for data generation with probabilistic graphical models

This page was built for publication: Probabilistic graphical models follow directly from maximum entropy

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