𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Bayesian Network Learning Algorithm Based on Independence Test and Ant Colony Optimization

✍ Scribed by Jun-Zhong JI; Hong-Xun ZHANG; Ren-Bing HU; Chun-Nian LIU

Publisher
Elsevier
Year
2009
Weight
360 KB
Volume
35
Category
Article
ISSN
1874-1029

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An iterated local search algorithm for l
An iterated local search algorithm for learning Bayesian networks with restarts based on conditional independence tests
✍ Luis M. De Campos; Juan M. FernΓ‘ndez-Luna; J. Miguel Puerta πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

A common approach for learning Bayesian networks (BNs) from data is based on the use of a scoring metric to evaluate the fitness of any given candidate network to the data and a method to explore the search space, which usually is the set of directed acyclic graphs (DAGs). The most efficient search

Multiple sequence alignment algorithm ba
Multiple sequence alignment algorithm based on a dispersion graph and ant colony algorithm
✍ Weiyang Chen; Bo Liao; Wen Zhu; Xuyu Xiang πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 213 KB

## Abstract In this article, we describe a representation for the processes of multiple sequences alignment (MSA) and used it to solve the problem of MSA. By this representation, we took every possible aligning result into account by defining the representation of gap insertion, the value of heuris

A genetic algorithm with deterministic m
A genetic algorithm with deterministic mutation based on neural network learning
✍ Minoru Fukumi; Norio Akamatsu πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 189 KB πŸ‘ 2 views

This paper presents a method for designing neural networks using a genetic algorithm (GA) with deterministic mutation (DM) based on learning. The GA presented in this paper has a large framework including DM, which is performed on the basis of the results from neural network learning. It can achieve