Referenced Items are not available for this document.
The search of optimal Bayesian network from a database of observations is NP-hard. Nevertheless, several heuristic search strategies have been found to be effective. We present a new population-based algorithm to learn the structure of Bayesian networks without assuming any ordering of nodes and allowing for the presence of both discrete and continuous random variables. Numerical performances of our mixed-genetic algorithm, (M-GA), are investigated on a case study taken from the literature and compared with greedy search
Published in:
Computational Intelligence for Modelling, Control and Automation, 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, International Conference on
(Volume:2
)
Date of Conference: 28-30 Nov. 2005
- Page(s):
- 61 - 67
- Print ISBN:
- 0-7695-2504-0
- INSPEC Accession Number:
- 9109360
- Conference Location :
- Vienna
- Digital Object Identifier :
- 10.1109/CIMCA.2005.1631446
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
