aGrUM  0.16.0
treeRegress.h
Go to the documentation of this file.
1 
31 #ifndef GUM_TREE_REGRESS_H
32 #define GUM_TREE_REGRESS_H
33 
34 #include <functional>
35 
38 
39 namespace gum {
40 
48  template < typename GUM_SCALAR,
49  template < typename >
50  class COMBINEOPERATOR,
51  template < typename >
52  class PROJECTOPERATOR,
53  template < typename > class TerminalNodePolicy =
54  ExactTerminalNodePolicy >
55  class TreeRegress {
56  public:
57  // ============================================================================
59  // ============================================================================
61 
65  const Bijection<
66  const DiscreteVariable*,
68 
70  ~TreeRegress();
71 
73  // ============================================================================
75  // ============================================================================
77 
81 
83 
84  private:
87  __xPloreVFunc(NodeId currentNodeId);
88 
91  const Bijection<
92  const DiscreteVariable*,
96  };
97 
98 #ifndef GUM_NO_EXTERN_TEMPLATE_CLASS
100 #endif
101 
102 } // namespace gum
103 
105 
106 #endif // GUM_REGRESS_H
Class used to perform Decision Tree Regression in the FMDP Framework.
Definition: treeRegress.h:55
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
TreeRegress(const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > *qAction, const Bijection< const DiscreteVariable *, const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > * > pxi)
Default constructor.
Base class for discrete random variable.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
~TreeRegress()
Default destructor.
The class for generic Hash Tables.
Definition: hashTable.h:679
const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > * __vFunc
The function graphs used for the operation.
Definition: treeRegress.h:90
MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > * compute()
Computes and builds the Function Graph that is the result of the operation.
Set of pairs of elements with fast search for both elements.
Definition: bijection.h:1805
Class implementingting a function graph.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
const Bijection< const DiscreteVariable *, const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > *> __pxi
Definition: treeRegress.h:94
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
HashTable< const DiscreteVariable *, Idx > __context
Definition: treeRegress.h:95
MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > * __xPloreVFunc(NodeId currentNodeId)
The whatever 1.
Size NodeId
Type for node ids.
Definition: graphElements.h:98