![]() |
aGrUM
0.20.3
a C++ library for (probabilistic) graphical models
|
Modules | |
Database Manipulations | |
Scores and Independence Tests | |
Scores A Priori | |
Structural Constraints | |
Parameters utilities | |
Classes | |
class | gum::learning::BNLearner< GUM_SCALAR > |
A pack of learning algorithms that can easily be used. More... | |
class | gum::learning::BNLearnerListener |
A class that redirects gum_signal from algorithms to the listeners of BNLearn. More... | |
class | gum::learning::genericBNLearner |
A pack of learning algorithms that can easily be used. More... | |
class | gum::learning::StructuralConstraintEmpty |
the base class for all structural constraints More... | |
class | gum::learning::StructuralConstraintDAG |
The base class for structural constraints imposed by DAGs. More... | |
class | gum::learning::StructuralConstraintDiGraph |
The base class for structural constraints used by learning algorithms that learn a directed graph structure. More... | |
class | gum::learning::StructuralConstraintForbiddenArcs |
the structural constraint for forbidding the creation of some arcs during structure learning More... | |
class | gum::learning::StructuralConstraintIndegree |
the class for structural constraints limiting the number of parents of nodes in a directed graph More... | |
class | gum::learning::StructuralConstraintMandatoryArcs |
the structural constraint indicating that some arcs shall never be removed or reversed More... | |
class | gum::learning::StructuralConstraintPossibleEdges |
the structural constraint for forbidding the creation of some arcs except those defined in the class during structure learning More... | |
class | gum::learning::StructuralConstraintSetStatic< CONSTRAINT1, OTHER_CONSTRAINTS > |
the "meta-programming" class for storing structural constraintsIn aGrUM, there are two ways to store sets of structural constraints: the first one is to put them into a StructuralConstraintSetDynamic. More... | |
class | gum::learning::StructuralConstraintSliceOrder |
the structural constraint imposing a partial order over nodes More... | |
class | gum::learning::StructuralConstraintTabuList |
The class imposing a N-sized tabu list as a structural constraints for learning algorithms. More... | |
class | gum::learning::StructuralConstraintUndiGraph |
The base class for structural constraints used by learning algorithms that learn an undirected graph structure. More... | |
class | gum::learning::GreedyHillClimbing |
The greedy hill climbing learning algorithm (for directed graphs) More... | |
class | gum::learning::K2 |
The K2 algorithm. More... | |
class | gum::learning::LocalSearchWithTabuList |
The local search with tabu list learning algorithm (for directed graphs) More... | |
class | gum::learning::Miic |
The miic learning algorithm. More... | |
class | gum::learning::GraphChange |
class | gum::learning::ArcAddition |
The class for notifying learning algorithms of new arc additionsThis class is convenient to know at compile time which graph change we are dealing with. More... | |
class | gum::learning::ArcDeletion |
The class for notifying learning algorithms of arc removalsThis class is convenient to know at compile time which graph change we are dealing with. More... | |
class | gum::learning::ArcReversal |
The class for notifying learning algorithms of arc reversalsThis class is convenient to know at compile time which graph change we are dealing with. More... | |
class | gum::learning::EdgeAddition |
The class for notifying learning algorithms of new edge additionsThis class is convenient to know at compile time which graph change we are dealing with. More... | |
class | gum::learning::EdgeDeletion |
The class for notifying learning algorithms of edge removalsThis class is convenient to know at compile time which graph change we are dealing with. More... | |
class | gum::learning::GraphChangesGenerator4DiGraph< STRUCT_CONSTRAINT > |
The basic class for computing the next graph changes possible in a structure learning algorithm. More... | |
class | gum::learning::GraphChangesGenerator4K2< STRUCT_CONSTRAINT > |
The basic class for computing the next graph changes possible in a structure learning algorithm. More... | |
class | gum::learning::GraphChangesGenerator4UndiGraph< STRUCT_CONSTRAINT > |
The basic class for computing the next graph changes possible in an undirected structure learning algorithm. More... | |
class | gum::learning::GraphChangesGeneratorOnSubDiGraph< STRUCT_CONSTRAINT > |
The basic class for computing the next graph changes possible in a structure learning algorithm. More... | |
class | gum::learning::GraphChangesSelector4DiGraph< STRUCTURAL_CONSTRAINT, GRAPH_CHANGES_GENERATOR, ALLOC > |
The mecanism to compute the next available graph changes for directed structure learning search algorithms. More... | |