![]() |
aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
|
Directories | |
| BNLearnUtils | |
| constraints | |
| paramUtils | |
| priors | |
| scores_and_tests | |
| structureUtils | |
Files | |
| BNLearner.cpp | |
| BNLearner.h | |
| A basic pack of learning algorithms that can easily be used. | |
| BNLearner_tpl.h | |
| A pack of learning algorithms that can easily be used. | |
| correctedMutualInformation.cpp | |
| Implementation of gum::learning::CorrectedMutualInformation. | |
| correctedMutualInformation.h | |
| The class computing n times the corrected mutual information (where n is the size (or the weight) of the database) as used in the MIIC algorithm. | |
| correctedMutualInformation_inl.h | |
| The class computing n times the corrected mutual information, as used in the MIIC algorithm. | |
| greedyHillClimbing.cpp | |
| The greedy hill learning algorithm (for directed graphs). | |
| greedyHillClimbing.h | |
| The greedy hill learning algorithm (for directed graphs). | |
| greedyHillClimbing_tpl.h | |
| The greedy hill learning algorithm (for directed graphs). | |
| K2.cpp | |
| The K2 algorithm. | |
| K2.h | |
| The K2 algorithm. | |
| K2_inl.h | |
| The K2 algorithm. | |
| K2_tpl.h | |
| The K2 algorithm. | |
| localSearchWithTabuList.cpp | |
| The local search learning algorithm (for directed graphs). | |
| localSearchWithTabuList.h | |
| The local search learning with tabu list algorithm (for directed graphs). | |
| localSearchWithTabuList_inl.h | |
| The local search learning algorithm (for directed graphs). | |
| localSearchWithTabuList_tpl.h | |
| The local search with tabu list learning algorithm (for directed graphs). | |
| Miic.cpp | |
| Implementation of gum::learning::Constraint MIIC. | |
| Miic.h | |
| The Miic algorithm. | |
| SimpleMiic.cpp | |
| Implementation of gum::learning:: MIIC. | |
| SimpleMiic.h | |
| The SimpleMiic algorithm. | |