aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
bdeuPrior.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
47#ifndef GUM_LEARNING_PRIOR_BDEU_H
48#define GUM_LEARNING_PRIOR_BDEU_H
49
50#include <vector>
51
52#include <agrum/agrum.h>
53
55
56namespace gum::learning {
57
71 class BDeuPrior: public Prior {
72 public:
73 // ##########################################################################
75 // ##########################################################################
77
79
89 explicit BDeuPrior(const DatabaseTable& database,
90 const Bijection< NodeId, std::size_t >& nodeId2columns
92
94 BDeuPrior(const BDeuPrior& from);
95
97 BDeuPrior(BDeuPrior&& from) noexcept;
98
100 BDeuPrior* clone() const override;
101
103 virtual ~BDeuPrior();
104
106
107
108 // ##########################################################################
110 // ##########################################################################
112
115
117 BDeuPrior& operator=(BDeuPrior&& from) noexcept;
118
120
121
122 // ##########################################################################
124 // ##########################################################################
126
128 void setWeight(double weight) final;
129
132
134 PriorType getType() const final;
135
137
144 bool isInformative() const final;
145
147
152 void addJointPseudoCount(const IdCondSet& idset, std::vector< double >& counts) final;
153
159 void addConditioningPseudoCount(const IdCondSet& idset, std::vector< double >& counts) final;
160
162 };
163
164} // namespace gum::learning
165
166// include the inlined functions if necessary
167#ifndef GUM_NO_INLINE
169#endif /* GUM_NO_INLINE */
170
171#endif /* GUM_LEARNING_PRIOR_BDEU_H */
the internal prior for the BDeu score (N' / (r_i * q_i)
void setEffectiveSampleSize(double weight)
sets the effective sample size N'
BDeuPrior * clone() const override
virtual copy constructor
BDeuPrior(const BDeuPrior &from)
copy constructor
bool isInformative() const final
indicates whether the prior is tensorly informative
BDeuPrior(BDeuPrior &&from) noexcept
move constructor
void addConditioningPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vector defined over the right hand side of the idset
void addJointPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vector corresponding to the idset
BDeuPrior & operator=(const BDeuPrior &from)
copy operator
BDeuPrior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
PriorType getType() const final
returns the type of the prior
virtual ~BDeuPrior()
destructor
BDeuPrior & operator=(BDeuPrior &&from) noexcept
move operator
void setWeight(double weight) final
sets the effective sample size N' (alias of setEffectiveSampleSize ())
The class representing a tabular database as used by learning tasks.
A class for storing a pair of sets of NodeIds, the second one corresponding to a conditional set.
Definition idCondSet.h:214
Prior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
double weight() const
returns the weight assigned to the prior
include the inlined functions if necessary
Definition CSVParser.h:54
STL namespace.
the base class for all a priori