|
Abstract
|
|
|---|---|
| Thanks to their inherent properties, probabilistic graphical models are one of the prime candidates for machine learning and decision making tasks especially in uncertain domains. Their capabilities, like representation, inference and learning, if used effectively, can greatly help to build intelligent systems that are able to act accordingly in different problem domains. Bayesian networks are one of the most widely used class of these models. Some of the inference and learning tasks in Bayesian networks involve complex optimization problems that require the use of meta-heuristic algorithms. Evolutionary algorithms, as successful problem solvers, are promising candidates for this purpose. This paper reviews the application of evolutionary algorithms for solving some NP-hard optimization tasks in Bayesian network inference and learning. | |
|
International
|
Si |
|
JCR
|
Si |
|
Title
|
Information Sciences |
|
ISBN
|
0020-0255 |
|
Impact factor JCR
|
2,833 |
|
Impact info
|
Datos JCR del año 2011 |
|
Volume
|
233 |
|
|
|
|
Journal number
|
0 |
|
From page
|
109 |
|
To page
|
125 |
|
Month
|
SIN MES |
|
Ranking
|
|