Learning Bayesian networks based on bi-velocity discrete particle swarm optimization with mutation operator
DOI10.1515/MATH-2018-0086zbMath1486.68162OpenAlexW2888836972MaRDI QIDQ1738196
Publication date: 29 March 2019
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2018-0086
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probabilistic graphical models (62H22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural learning of Bayesian networks by bacterial foraging optimization
- A hybrid Bayesian network learning method for constructing gene networks
- Towards scalable and data efficient learning of Markov boundaries
- A Bayesian method for the induction of probabilistic networks from data
- Ant colony optimization for learning Bayesian networks.
- A time-varying model of rational learning
- Learning Bayesian networks: The combination of knowledge and statistical data
- BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
- A Bayesian Network Learning Algorithm Based on Independence Test and Ant Colony Optimization
- Learning Bayesian Network Equivalence Classes with Ant Colony Optimization
- 10.1162/153244303321897717
This page was built for publication: Learning Bayesian networks based on bi-velocity discrete particle swarm optimization with mutation operator