![]() |
aGrUM
0.14.2
|
The 3off2 algorithm. More...
#include <string>
#include <vector>
#include <agrum/BN/BayesNet.h>
#include <agrum/config.h>
#include <agrum/core/approximations/IApproximationSchemeConfiguration.h>
#include <agrum/core/approximations/approximationScheme.h>
#include <agrum/core/heap.h>
#include <agrum/graphs/DAG.h>
#include <agrum/graphs/mixedGraph.h>
#include <agrum/learning/scores_and_tests/correctedMutualInformation.h>
Go to the source code of this file.
Classes | |
class | gum::learning::GreaterPairOn2nd |
class | gum::learning::GreaterAbsPairOn2nd |
class | gum::learning::GreaterTupleOnLast |
class | gum::learning::Miic |
The miic learning algorithm. More... | |
Namespaces | |
gum | |
gum is the global namespace for all aGrUM entities | |
gum::learning | |
The 3off2 algorithm.
The ThreeOffTwo class implements the 3off2 algorithm as proposed by Affeldt and al. in https://doi.org/10.1186/s12859-015-0856-x. It starts by eliminating edges that correspond to independent variables to build the skeleton of the graph, and then directs the remaining edges to get an essential graph. Latent variables can be detected using bi-directed arcs.
The variant MIIC is also implemented based on https://doi.org/10.1371/journal.pcbi.1005662. Only the orientation phase differs from 3off2, with a diffferent ranking method and different propagation rules.
Definition in file Miic.h.