greedyHillClimbing.h File Reference

The greedy hill learning algorithm (for directed graphs). More...

#include <string>
#include <vector>
#include <agrum/agrum.h>
#include <agrum/base/core/approximations/approximationScheme.h>
#include <agrum/BN/BayesNet.h>
#include <agrum/BN/learning/greedyHillClimbing_tpl.h>

Include dependency graph for greedyHillClimbing.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	gum::learning::GreedyHillClimbing
	The greedy hill climbing learning algorithm (for directed graphs). More...

Namespaces
namespace	gum
	gum is the global namespace for all aGrUM entities
namespace	gum::learning
	include the inlined functions if necessary

Detailed Description

The greedy hill learning algorithm (for directed graphs).

The GreedyHillClimbing class implements a greedy search in which the only the graph changes that increase the global score are applied. Those that increase it the more are applied first. The algorithm stops when no single change can increase the score anymore.

Author

Christophe GONZALES(_at_AMU) and Pierre-Henri WUILLEMIN(_at_LIP6)

Definition in file greedyHillClimbing.h.