localSearchWithTabuList.h File Reference

The local search learning with tabu list algorithm (for directed graphs) More...

#include <string>
#include <vector>
#include <agrum/BN/BayesNet.h>
#include <agrum/core/approximations/approximationScheme.h>
#include <agrum/graphs/DAG.h>
#include <agrum/learning/localSearchWithTabuList_inl.h>
#include <agrum/learning/localSearchWithTabuList_tpl.h>

Include dependency graph for localSearchWithTabuList.h:

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

Go to the source code of this file.

Classes
class	gum::learning::LocalSearchWithTabuList
	The local search with tabu list learning algorithm (for directed graphs) More...

Namespaces
	gum
	gum is the global namespace for all aGrUM entities
	gum::learning

Detailed Description

The local search learning with tabu list algorithm (for directed graphs)

The LocalSearchWithTabuList class implements a greedy search in which we allow applying at most N consecutive graph changes that decrease the score. To prevent infinite loops, when using local search, you should use a structural constraint that includes a tabu list of at least N elements.

Author

Christophe GONZALES and Pierre-Henri WUILLEMIN

Definition in file localSearchWithTabuList.h.