On finding the best combination of events in a Bayesian network
Faculty / School
Faculty of Computer Sciences (FCS)
Department
Department of Computer Science
Was this content written or created while at IBA?
Yes
Document Type
Conference Paper
Publication Date
12-2008
Conference Name
The Fourth IASTED International Conference on Advances in Computer Science and Technology (ACST 2008)
Conference Location
Langkawi, Malaysia
Conference Dates
2-4 April 2008
ISBN/ISSN
62649092135 (Scopus)
Volume
605
Issue
102
First Page
378
Publisher
ACTA Press
Keywords
Bayesian networks, Combinatorial optimization, Computational intelligence, Evolutionary algorithms, Influence nets, Soft computing
Abstract / Description
The paper presents two schemes to identify the best combination of events that maximize (minimize) the probability of a target node in a Bayesian network (BN). One scheme is based on evolutionary algorithms (EA) while the other is a heuristic approach, named Sets of Actions Finder (SAF). The heuristic approach is similar to the hill-climbing search technique and works in polynomial time. Both SAF and EA are applied over hundreds of Bayesian networks and the results are compared with the ones obtained through exhaustive searches. The results show that both SAF and EA perform quite similarly but the time taken by SAF is smaller compared to EA.
Recommended Citation
Haider, S. (2008). On finding the best combination of events in a Bayesian network., 605 (102), 378. Retrieved from https://ir.iba.edu.pk/faculty-research-series/60
COinS
