#include <string>
#include <vector>
#include <agrum/BN/BayesNet.h>
#include <agrum/tools/core/approximations/approximationScheme.h>
#include <agrum/tools/graphs/DAG.h>
#include <agrum/BN/learning/localSearchWithTabuList_inl.h>
#include <agrum/BN/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
	Copyright (c) 2005-2021 by Pierre-Henri WUILLEMIN() & Christophe GONZALES() info_at_agrum_dot_org.

	gum::learning

Detailed Description

This library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License along with this library. If not, see http://www.gnu.org/licenses/.

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.

Classes

Namespaces

Detailed Description