aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
regress.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 by *
5 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
6 * - Christophe GONZALES(_at_AMU) *
7 * *
8 * The aGrUM/pyAgrum library is free software; you can redistribute it *
9 * and/or modify it under the terms of either : *
10 * *
11 * - the GNU Lesser General Public License as published by *
12 * the Free Software Foundation, either version 3 of the License, *
13 * or (at your option) any later version, *
14 * - the MIT license (MIT), *
15 * - or both in dual license, as here. *
16 * *
17 * (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18 * *
19 * This aGrUM/pyAgrum library is distributed in the hope that it will be *
20 * useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26 * OTHER DEALINGS IN THE SOFTWARE. *
27 * *
28 * See LICENCES for more details. *
29 * *
30 * SPDX-FileCopyrightText: Copyright 2005-2025 *
31 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
32 * - Christophe GONZALES(_at_AMU) *
33 * SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34 * *
35 * Contact : info_at_agrum_dot_org *
36 * homepage : http://agrum.gitlab.io *
37 * gitlab : https://gitlab.com/agrumery/agrum *
38 * *
39 ****************************************************************************/
40
41
50
51#ifndef GUM_REGRESS_H
52#define GUM_REGRESS_H
53
55
56namespace gum {
57
65 template < typename GUM_SCALAR,
66 template < typename > class COMBINEOPERATOR,
67 template < typename > class PROJECTOPERATOR,
68 template < typename > class TerminalNodePolicy = ExactTerminalNodePolicy >
69 class Regress {
70 public:
71 // ============================================================================
73 // ============================================================================
75
79 const gum::VariableSet* primedVars,
80 const DiscreteVariable* targetVar,
81 const GUM_SCALAR neutral);
82
84 ~Regress();
85
87
88 // ============================================================================
90 // ============================================================================
92
96
98
99 private:
103 void _establishVarOrder_();
104
108 void
111
113 NodeId _compute_(O4DGContext& currentSituation, Idx lastInstVarPos);
114
117
120
123
126
129
131 const GUM_SCALAR _neutral_;
132
135
137 const COMBINEOPERATOR< GUM_SCALAR > _combine_;
138 const PROJECTOPERATOR< GUM_SCALAR > _project_;
139
143
148
150 short int* _default_;
151 };
152
153#ifndef GUM_NO_EXTERN_TEMPLATE_CLASS
155#endif
156
157} // namespace gum
158
160
161#endif // GUM_REGRESS_H
Base class for discrete random variable.
Implementation of a Terminal Node Policy that maps nodeid directly to value.
The class for generic Hash Tables.
Definition hashTable.h:637
Class used to manipulate context during Function Graph Operations.
Definition o4DGContext.h:70
Class used to perform Function Graph Operations in the FMDP Framework.
Definition regress.h:69
const DiscreteVariable * _targetVar_
The variable we work on to eleminate.
Definition regress.h:128
short int * _default_
Just a computationnal trick.
Definition regress.h:150
HashTable< double, NodeId > _explorationTable_
The hashtable used to know if two pair of nodes have already been visited.
Definition regress.h:142
Regress(const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > *vfunction, const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > *probDist, const gum::VariableSet *primedVars, const DiscreteVariable *targetVar, const GUM_SCALAR neutral)
Default constructor.
Definition regress_tpl.h:64
const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > * _DG1_
One of the two function graphs used for the operation.
Definition regress.h:116
HashTable< NodeId, short int * > _DG1InstantiationNeeded_
Table uses to know if a given node of given function graph has retrograde variables.
Definition regress.h:146
void _establishVarOrder_()
Computes an order for the final Decision graph that will minimize the number of re exploration.
const GUM_SCALAR _neutral_
The function to be performed on the leaves.
Definition regress.h:131
MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > * _rd_
The resulting function graph.
Definition regress.h:122
HashTable< NodeId, short int * > _DG2InstantiationNeeded_
Definition regress.h:147
const PROJECTOPERATOR< GUM_SCALAR > _project_
Definition regress.h:138
const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > * _DG2_
The other one.
Definition regress.h:119
void _findRetrogradeVariables_(const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > *dg, HashTable< NodeId, short int * > &dgInstNeed)
Establish for each node in both function graph if it has retrograde variables beneath it.
Idx _nbVar_
The total number of variable implied in the operation.
Definition regress.h:134
MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > * compute()
Computes and builds the Function Graph that is the result of the operation.
const COMBINEOPERATOR< GUM_SCALAR > _combine_
The functions to be performed on the leaves.
Definition regress.h:137
const gum::VariableSet * _primedVars_
The set of variables we want to keep at the end.
Definition regress.h:125
NodeId _compute_(O4DGContext &currentSituation, Idx lastInstVarPos)
The main recursion function.
~Regress()
Default destructor.
Definition regress_tpl.h:85
Size Idx
Type for indexes.
Definition types.h:79
Size NodeId
Type for node ids.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
Set< const DiscreteVariable * > VariableSet
Class used to manipulate o4DGContext in Function Graph Operations.
Class used to compute the operation between two decision diagrams.