31 #ifndef GUM_LEARNING_GREEDY_HILL_CLIMBING_H 32 #define GUM_LEARNING_GREEDY_HILL_CLIMBING_H 104 template <
typename GRAPH_CHANGES_
SELECTOR >
115 template <
typename GUM_SCALAR =
double,
116 typename GRAPH_CHANGES_SELECTOR,
117 typename PARAM_ESTIMATOR >
119 PARAM_ESTIMATOR& estimator,
Class representing a Bayesian Network.
This file contains general scheme for iteratively convergent algorithms.
The greedy hill learning algorithm (for directed graphs)
BayesNet< GUM_SCALAR > learnBN(GRAPH_CHANGES_SELECTOR &selector, PARAM_ESTIMATOR &estimator, DAG initial_dag=DAG())
learns the structure and the parameters of a BN
Class representing Bayesian networks.
gum is the global namespace for all aGrUM entities
ApproximationScheme & approximationScheme()
returns the approximation policy of the learning algorithm
DAG learnStructure(GRAPH_CHANGES_SELECTOR &selector, DAG initial_dag=DAG())
learns the structure of a Bayes net
The greedy hill climbing learning algorithm (for directed graphs)
~GreedyHillClimbing()
destructor
GreedyHillClimbing()
default constructor
Base classes for directed acyclic graphs.
GreedyHillClimbing & operator=(const GreedyHillClimbing &from)
copy operator