Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning
DOI10.1155/2014/625173zbMATH Open1407.68403OpenAlexW2113568591WikidataQ59066671 ScholiaQ59066671MaRDI QIDQ1718795FDOQ1718795
Authors: Guangyi Liu, Ou Li, Dalong Zhang, Tao Song 
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/625173
Recommendations
- An efficient Bayesian network structure learning strategy
- Bayesian network structure learning: hybridizing complete search with independence tests
- scientific article; zbMATH DE number 6453553
- Bayesian network structure learning based on hybrid genetic and fish swarm algorithm
- Bayesian network structure learning based on restricted particle swarm optimization
Learning and adaptive systems in artificial intelligence (68T05) Estimation in multivariate analysis (62H12)
Cites Work
- Causation, prediction, and search
- A Bayesian method for the induction of probabilistic networks from data
- A characterization of Markov equivalence classes for acyclic digraphs
- Learning Bayesian networks: The combination of knowledge and statistical data
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- The max-min hill-climbing Bayesian network structure learning algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective
Cited In (3)
Uses Software
This page was built for publication: Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718795)
