Ant colony optimization for learning Bayesian networks.

DOI10.1016/S0888-613X(02)00091-9zbMath1033.68091OpenAlexW2055037429MaRDI QIDQ1399508

Juan M. Fernández-Luna, Luis M. de Campos, José A. Gámez, José M. Puerta

Publication date: 30 July 2003

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0888-613x(02)00091-9

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (19)

A novel discrete particle swarm optimization algorithm for solving bayesian network structures learning problem ⋮ A multi-objective evolutionary algorithm for enhancing Bayesian networks hybrid-based modeling ⋮ Bayesian network models for incomplete and dynamic data ⋮ Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood ⋮ Structural learning of Bayesian networks by bacterial foraging optimization ⋮ 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 ⋮ Evolutionary Computational Technique in Automatic Generation Control of Multi-area Power Systems with Nonlinearity and Energy Storage Unit ⋮ Differential-evolution-based coevolution ant colony optimization algorithm for Bayesian network structure learning ⋮ Learning Bayesian networks based on bi-velocity discrete particle swarm optimization with mutation operator ⋮ Metaheuristics for Score-and-Search Bayesian Network Structure Learning ⋮ BNC-PSO: structure learning of Bayesian networks by particle swarm optimization ⋮ Learning the naive Bayes classifier with optimization models ⋮ ACS-TS: Train scheduling using ant colony system ⋮ Approximation algorithms for restricted Bayesian network structures ⋮ Bayesian network learning algorithms using structural restrictions ⋮ An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms ⋮ Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation ⋮ Structure learning of Bayesian networks using global optimization with applications in data classification

Uses Software

• TETRAD
• BENEDICT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Causation, prediction, and search
• A Bayesian method for the induction of probabilistic networks from data
• Construction of Bayesian network structures from data: A brief survey and an efficient algorithm
• Adaptive probabilistic networks with hidden variables
• A new approach for learning belief networks using independence criteria
• Learning Bayesian networks: The combination of knowledge and statistical data
• Searching for the best elimination sequence in Bayesian networks by using ant colony optimization
• Learning Bayesian networks in the space of structures by estimation of distribution algorithms
• Independency relationships and learning algorithms for singly connected networks
• A hybrid methodology for learning belief networks: BENEDICT

This page was built for publication: Ant colony optimization for learning Bayesian networks.