greedyHillClimbing.h File Reference

Copyright (c) 2005-2021 by Pierre-Henri WUILLEMIN() & Christophe GONZALES() info_at_agrum_dot_org. More...

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

Detailed Description

Copyright (c) 2005-2021 by Pierre-Henri WUILLEMIN() & Christophe GONZALES() info_at_agrum_dot_org.

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 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() and Pierre-Henri WUILLEMIN()

Definition in file greedyHillClimbing.h.