greedyThickThinning.h File Reference

The greedy thick-thinning 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/greedyThickThinning_tpl.h>

Include dependency graph for greedyThickThinning.h:

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

Go to the source code of this file.

Classes
class	gum::learning::GreedyThickThinning
	The greedy thick-thinning 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 thick-thinning learning algorithm (for directed graphs).

The GreedyThickThinning class implements a two-phase greedy search:

• Thick phase: only arc additions are applied until no addition improves the score (produces a dense supergraph).
• Thin phase: only arc deletions (and optionally arc reversals) are applied until no such change improves the score.

Author

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

Definition in file greedyThickThinning.h.