scientific article; zbMATH DE number 1753154

MaRDI QIDQ4533364zbMATH OpenFDO

Authors

Publication date 10 June 2002

zbMATH Keywords

optimal path graphical model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Large-sample learning of Bayesian networks is NP-hard
• Learning Bayesian Networks Does Not Have to Be NP-Hard
• On finding optimal polytrees
• Parent Assignment Is Hard for the MDL, AIC, and NML Costs
• Maximum likelihood bounded tree-width Markov networks

Cited in

(7)

• Constructing the basis path set by eliminating the path dependency
• Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
• Parent Assignment Is Hard for the MDL, AIC, and NML Costs
• A backward selection procedure for approximating a discrete probability distribution by decomposable models
• Graphical modeling of stochastic processes driven by correlated noise
• On finding optimal polytrees
• Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu

This page was built for publication:

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