Ant colony optimization for learning Bayesian networks.

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

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

Publication date: 30 July 2003

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

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

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

Related Items

Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood, 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, A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning

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