#include <agrum/agrum.h>
#include <agrum/tools/core/OMPThreads.h>
#include <agrum/tools/core/set.h>
#include <agrum/tools/graphs/diGraph.h>
#include <agrum/BN/learning/structureUtils/IGraphChangesGenerator4DiGraph.h>
#include <agrum/BN/learning/structureUtils/graphChange.h>
#include <agrum/BN/learning/structureUtils/graphChangesGeneratorOnSubDiGraph_tpl.h>

Include dependency graph for graphChangesGeneratorOnSubDiGraph.h:

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

Go to the source code of this file.

Classes
class	gum::learning::GraphChangesGeneratorOnSubDiGraph< STRUCT_CONSTRAINT >
	The basic class for computing the next graph changes possible in a structure learning algorithm. 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 class for computing the set of graph changes (over a subgraph) transmitted to learning algorithms

Structure learning algorithm try different modifications of the graph. Class GraphChangesGeneratorOnSubDiGraph provides a simple way to compute those that we wish to perform when we wish to limit the set of changes over a subgraph of the graph we learn. For instance, we may wish to relearn an already partially learnt structure just around nodes A,B,C. In this case, we can set the set of target nodes of the GraphChangesGeneratorOnSubDiGraph to {A,B,C} and the set of starting nodes as all the nodes of the graph. In this case, only the arcs whose heads are A, B or C will be trnasmitted to the learning algorithm.

Basically, the idea is to use method setGraph at the beginning of the structure learning in order to initialize the possible set of operators. Then, parse this set using a for ( auto iter = operator_set.begin (); iter != operator_set.end (); ++iter ) loop and compute the scores induced by these changes. When this is done, flush the operator set by calling method clearChanges. Then iterate changes and after each new change applied, used again the iterator for loop, and so on. Note that, whenever you execute method modifyGraph, this will automatically flush the current list of changes and put into the list only the changes that are affected by the graph modification.

Author: Christophe GONZALES() and Pierre-Henri WUILLEMIN()

Definition in file graphChangesGeneratorOnSubDiGraph.h.

Classes

Namespaces

Detailed Description