scientific article; zbMATH DE number 6253893
From MaRDI portal
Publication:5396622
zbMath1280.68226MaRDI QIDQ5396622
Cassio Polpo de Campos, Qiang Ji
Publication date: 3 February 2014
Full work available at URL: http://www.jmlr.org/papers/v12/decampos11a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bayesian networksstructural constraintsstructure learningbranch-and-bound techniqueproperties of decomposable scores
Related Items (28)
Polyhedral aspects of score equivalence in Bayesian network structure learning ⋮ Gaussian Bayesian network comparisons with graph ordering unknown ⋮ Inferring dynamic gene regulatory networks with low-order conditional independencies -- an evaluation of the method ⋮ Exact estimation of multiple directed acyclic graphs ⋮ A novel Chow-Liu algorithm and its application to gene differential analysis ⋮ Learning Bounded Tree-Width Bayesian Networks via Sampling ⋮ Characteristic imsets for learning Bayesian network structure ⋮ Entropy-based pruning for learning Bayesian networks using BIC ⋮ Bayesian network data imputation with application to survival tree analysis ⋮ Joint analysis of multiple algorithms and performance measures ⋮ An efficient Bayesian network structure learning strategy ⋮ Hierarchical estimation of parameters in Bayesian networks ⋮ On pruning with the MDL score ⋮ Learning extended tree augmented naive structures ⋮ Algorithms for learning parsimonious context trees ⋮ Revising the structure of Bayesian network classifiers in the presence of missing data ⋮ Learning Bayesian network structure: towards the essential graph by integer linear programming tools ⋮ Polyhedral approaches to learning Bayesian networks ⋮ Fast monotone summation over disjoint sets ⋮ Mathematical modeling for active and dynamic diagnosis of crop diseases based on Bayesian networks and incremental learning ⋮ Model free estimation of graphical model using gene expression data ⋮ Metaheuristics for Score-and-Search Bayesian Network Structure Learning ⋮ 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 ⋮ Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
This page was built for publication:
