Learning the Structure of a Bayesian Network: An Application of Information Geometry and the Minimum Description Length Principle

DOI10.1063/1.2149807MaRDI QIDQ5118723zbMATH OpenOpenAlexFDO

Authors Eitel J. M. Lauría

Publication date 26 August 2020

Published in AIP Conference Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.2149807

zbMATH Keywords

Bayesian networkinformation geometry

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Information geometry (statistical aspects) (62B11) Bayesian inference (62F15)

Recommendations

• An information-geometric approach to learning Bayesian network topologies from data
• Learning Bayesian networks: The combination of knowledge and statistical data
• scientific article; zbMATH DE number 6453553
• Efficient structure learning of Bayesian networks using constraints

Cited in

(4)

• Learning Bayesian networks from data: An information-theory based approach
• An information-geometric approach to learning Bayesian network topologies from data
• A microscopic study of minimum entropy search in learning decomposable Markov networks
• A methodology for developing Bayesian networks: an application to information technology (IT) implementation

This page was built for publication: Learning the Structure of a Bayesian Network: An Application of Information Geometry and the Minimum Description Length Principle

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