Learning Optimal Bayesian Networks: A Shortest Path Perspective

DOI10.1613/jair.4039zbMath1361.68182OpenAlexW2118196167WikidataQ129489990 ScholiaQ129489990MaRDI QIDQ2856471

Brandon Malone, Changhe Yuan

Publication date: 29 October 2013

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4039

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (17)

Temporal state change Bayesian networks for modeling of evolving multivariate state sequences: model, structure discovery and parameter estimation ⋮ Exact estimation of multiple directed acyclic graphs ⋮ Joint analysis of multiple algorithms and performance measures ⋮ On pruning with the MDL score ⋮ Causal structure learning: a combinatorial perspective ⋮ Revising the structure of Bayesian network classifiers in the presence of missing data ⋮ Learning the structure of Bayesian networks with ancestral and/or heuristic partition ⋮ Integer linear programming for the Bayesian network structure learning problem ⋮ BNC-PSO: structure learning of Bayesian networks by particle swarm optimization ⋮ Speeding up parameter and rule learning for acyclic probabilistic logic programs ⋮ Optimization problems for machine learning: a survey ⋮ Approximate structure learning for large Bayesian networks ⋮ Learning Bayesian network structures using weakest mutual-information-first strategy ⋮ Learning Bayesian networks with local structure, mixed variables, and exact algorithms ⋮ Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach ⋮ Anytime pack search ⋮ Truncated incremental search

This page was built for publication: Learning Optimal Bayesian Networks: A Shortest Path Perspective