aGrUM  0.14.2
greedyHillClimbing.cpp
Go to the documentation of this file.
1 /***************************************************************************
2  * Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN *
3  * {prenom.nom}@lip6.fr *
4  * *
5  * This program is free software; you can redistribute it and/or modify *
6  * it under the terms of the GNU General Public License as published by *
7  * the Free Software Foundation; either version 2 of the License, or *
8  * (at your option) any later version. *
9  * *
10  * This program is distributed in the hope that it wil be useful, *
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13  * GNU General Public License for more details. *
14  * *
15  * You should have received a copy of the GNU General Public License *
16  * along with this program; if not, write to the *
17  * Free Software Foundation, Inc., *
18  * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19  ***************************************************************************/
27 
28 namespace gum {
29 
30  namespace learning {
31 
34  setEpsilon(0);
38  GUM_CONSTRUCTOR(GreedyHillClimbing);
39  }
40 
43  ApproximationScheme(from) {
44  GUM_CONS_CPY(GreedyHillClimbing);
45  }
46 
49  ApproximationScheme(std::move(from)) {
50  GUM_CONS_MOV(GreedyHillClimbing);
51  }
52 
55  GUM_DESTRUCTOR(GreedyHillClimbing);
56  }
57 
61  ApproximationScheme::operator=(from);
62  return *this;
63  }
64 
67  ApproximationScheme::operator=(std::move(from));
68  return *this;
69  }
70 
73  return *this;
74  }
75 
76  } /* namespace learning */
77 
78 } /* namespace gum */
void disableMinEpsilonRate()
Disable stopping criterion on epsilon rate.
Approximation Scheme.
STL namespace.
gum is the global namespace for all aGrUM entities
Definition: agrum.h:25
ApproximationScheme & approximationScheme()
returns the approximation policy of the learning algorithm
void disableMaxTime()
Disable stopping criterion on timeout.
The greedy hill climbing learning algorithm (for directed graphs)
void setEpsilon(double eps)
Given that we approximate f(t), stopping criterion on |f(t+1)-f(t)|.
void disableMaxIter()
Disable stopping criterion on max iterations.
GreedyHillClimbing()
default constructor
The greedy hill learning algorithm (for directed graphs)
GreedyHillClimbing & operator=(const GreedyHillClimbing &from)
copy operator