Learning hybrid bayesian networks by MML

12Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditional probability tables (CPT), logit models, decision trees or hybrid models, i.e., combinations of the three.We compare this method with alternative local structure learning algorithms using the MDL and BDe metrics. Results are presented for both real and artificial data sets. Hybrid models compare favourably to other local structure learners, allowing simple representations given limited data combined with richer representations given massive data. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

O’Donnell, R. T., Allison, L., & Korb, K. B. (2006). Learning hybrid bayesian networks by MML. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4304 LNAI, pp. 192–203). Springer Verlag. https://doi.org/10.1007/11941439_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free