Name
Abstract | ||
|---|---|---|
Bayesian networks are probabilistic graphical models representing conditional dependencies among a set of random variables. Due to their concise representation of the joint probability distribution, Bayesian Networks are becoming incrementally popular models for knowledge representation and reasoning in various problem domains. However, learning the structure of the Bayesian networks is an NP-hard problem since the number of structures grows super-exponentially as the number of variables increases. This work therefore is aimed to propose a new hybrid structure learning algorithm that uses mutual dependencies to reduce the search space complexity and recruits the genetic algorithm to effectively search over the reduced space of possible structures. The proposed method is best suited for problems with medium to large number of variables and a limited dataset. It is shown that the proposed method achieves higher model's accuracy as compared to a series of popular structure learning algorithms particularly when the data size gets smaller. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2576768.2598223 | GECCO |
Keywords | Field | DocType |
graph and tree search strategies,bayesian networks,genetic algorithms,structure learning,heuristic methods | Intelligent control,Variable-order Bayesian network,Mathematical optimization,Joint probability distribution,Computer science,Wake-sleep algorithm,Bayesian network,Artificial intelligence,Graphical model,Bayesian statistics,Machine learning,Genetic algorithm | Conference |
Citations | PageRank | References |
6 | 0.44 | 23 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fatemeh Vafaee | 1 | 64 | 6.48 |