Learning Bayesian network structures by searching for the best ordering with genetic algorithms
β Scribed by Larranaga, P.; Kuijpers, C.M.H.; Murga, R.H.; Yurramendi, Y.
- Book ID
- 117873818
- Publisher
- IEEE
- Year
- 1996
- Tongue
- English
- Weight
- 953 KB
- Volume
- 26
- Category
- Article
- ISSN
- 1083-4427
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The induction of the optimal Bayesian network structure is NP-hard, justifying the use of search heuristics. Two novel population-based stochastic search approaches, univariate marginal distribution algorithm (UMDA) and population-based incremental learning (PBIL), are used to learn a Bayesian netwo
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