A decomposition algorithm for learning Bayesian networks based on scoring function
From MaRDI portal
Publication:1951225
DOI10.1155/2012/974063zbMATH Open1263.62046OpenAlexW2037165900WikidataQ58907039 ScholiaQ58907039MaRDI QIDQ1951225FDOQ1951225
Authors: Mingmin Zhu, Sanyang Liu 
Publication date: 3 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/974063
Recommendations
- Methods of constructing Bayesian networks based on scoring functions
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- scientific article; zbMATH DE number 5183798
- Min-BDeu and max-BDeu scores for learning Bayesian networks
- An efficient Bayesian network structure learning strategy
Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Applications of graph theory (05C90)
Cites Work
- Bayesian network structure learning by recursive autonomy identification
- A Bayesian method for the induction of probabilistic networks from data
- Title not available (Why is that?)
- The max-min hill-climbing Bayesian network structure learning algorithm
- Using Markov blankets for causal structure learning
- Adaptive probabilistic networks with hidden variables
- Learning Bayesian networks from data: An information-theory based approach
- Finding optimal Bayesian network given a super-structure
- Title not available (Why is that?)
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Title not available (Why is that?)
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Decomposition of structural learning about directed acyclic graphs
- A recursive method for structural learning of directed acyclic graphs
- A conditional independence algorithm for learning undirected graphical models
- Decomposition of search for \(v\)-structures in DAGs
- A Bayesian network learning algorithm based on independence test and ant colony optimization
Cited In (11)
- Min-BDeu and max-BDeu scores for learning Bayesian networks
- Title not available (Why is that?)
- Bayesian network structure learning by recursive autonomy identification
- Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks
- Structural learning for Bayesian networks by testing complete separators in prime blocks
- Entropy-based pruning for learning Bayesian networks using BIC
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- A construction algorithm of MPD-JT for Bayesian networks based on full conditional independence
- Decomposition and approximation of loopy Bayesian networks
- Learning directed acyclic graph SPNs in sub-quadratic time
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
Uses Software
This page was built for publication: A decomposition algorithm for learning Bayesian networks based on scoring function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1951225)
