Complexity statistical estimates of straightforward and greedy algorithms for algebraic Bayesian networks syntesis

MaRDI QIDQ4636099zbMATH OpenFDO

Authors Mikhail Anatol'Evich Zotov, Alexander L. Tulupyev, Alexander V. Sirotkin

Publication date 23 April 2018

zbMATH Keywords

probabilistic graphical modelsuncertainty representationalgebraic Bayesian networksprobabilistic-logic inferenceknowledge patternknowledge with uncertaintystatistical indicators for algorithm complexity

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Analysis of algorithms (68W40) Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 6419207
• Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation
• scientific article; zbMATH DE number 4128371
• Algebraic Bayesian networks: checking backbone connectivity
• Coincidence of the sets of minimal and irreducible join graphs over primary structure of algebraic Bayesian networks

Cited in

(1)

• scientific article; zbMATH DE number 6419207 (Why is no real title available?)

This page was built for publication: Complexity statistical estimates of straightforward and greedy algorithms for algebraic Bayesian networks syntesis

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