scientific article; zbMATH DE number 1946873
From MaRDI portal
Publication:4411162
zbMath1056.68142arXiv1107.0019MaRDI QIDQ4411162
Luis M. de Campos, Silvia Acid
Publication date: 7 July 2003
Full work available at URL: https://arxiv.org/abs/1107.0019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (15)
Bayesian learning of Bayesian networks with informative priors ⋮ The max-min hill-climbing Bayesian network structure learning algorithm ⋮ Constraint-based inference algorithms for structural models with latent confounders -- empirical application and simulation ⋮ An empirical comparison of popular structure learning algorithms with a view to gene network inference ⋮ Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood ⋮ Score-based methods for learning Markov boundaries by searching in constrained spaces ⋮ Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes ⋮ A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning ⋮ Structural Intervention Distance for Evaluating Causal Graphs ⋮ Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs ⋮ Bayesian network learning algorithms using structural restrictions ⋮ Marginal information for structure learning ⋮ Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework ⋮ Combining gene expression data and prior knowledge for inferring gene regulatory networks via Bayesian networks using structural restrictions ⋮ On using Bayesian networks for complexity reduction in decision trees
Uses Software
This page was built for publication: