Learning Bayesian networks from incomplete data with the node-average likelihood
From MaRDI portal
Publication:2060771
DOI10.1016/j.ijar.2021.07.015OpenAlexW3196873500MaRDI QIDQ2060771
Publication date: 13 December 2021
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14441
Related Items (2)
Being Bayesian about learning Gaussian Bayesian networks from incomplete data ⋮ Greedy structure learning from data that contain systematic missing values
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- The EM algorithm for graphical association models with missing data
- The max-min hill-climbing Bayesian network structure learning algorithm
- Consistency and asymptotic normality of the maximum likelihood estimator in generalized linear models
- Model selection and Akaike's information criterion (AIC): The general theory and its analytical extensions
- Causation, prediction, and search
- Estimating the dimension of a model
- Probability propagation
- Priors on network structures. Biasing the search for Bayesian networks
- An efficient Bayesian network structure learning strategy
- Learning Bayesian networks: The combination of knowledge and statistical data
- Consistent model selection of discrete Bayesian networks from incomplete data
- Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms
- Inference and missing data
- Maximum Likelihood Estimation of Misspecified Models
- A new look at the statistical model identification
This page was built for publication: Learning Bayesian networks from incomplete data with the node-average likelihood
