47#ifndef GUM_LEARNING_K2_H
48#define GUM_LEARNING_K2_H
121 template < typename GRAPH_CHANGES_SELECTOR >
125 template < typename GUM_SCALAR, typename GRAPH_CHANGES_SELECTOR, typename PARAM_ESTIMATOR >
127 PARAM_ESTIMATOR& estimator,
ApproximationScheme(bool verbosity=false)
Class representing a Bayesian network.
GreedyHillClimbing()
default constructor
const Sequence< NodeId > & order() const noexcept
returns the current order
K2(K2 &&from)
move constructor
K2 & operator=(K2 &&from)
move operator
Sequence< NodeId > _order_
the order on the variable used for learning
void setOrder(const Sequence< NodeId > &order)
sets the order on the variables
K2 & operator=(const K2 &from)
copy operator
K2(const K2 &from)
copy constructor
void _checkOrder_(const std::vector< Size > &modal)
checks that the order passed to K2 is coherent with the variables as specified by their modalities
DAG learnStructure(GRAPH_CHANGES_SELECTOR &selector, DAG initial_dag=DAG())
learns the structure of a Bayes net
void setOrder(const std::vector< NodeId > &order)
sets the order on the variables
ApproximationScheme & approximationScheme()
returns the approximation policy of the learning algorithm
BayesNet< GUM_SCALAR > learnBN(GRAPH_CHANGES_SELECTOR &selector, PARAM_ESTIMATOR &estimator, DAG initial_dag=DAG())
learns the structure and the parameters of a BN
The greedy hill learning algorithm (for directed graphs).
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities