aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
bdeuPrior_inl.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#pragma once
41
42
49#ifndef DOXYGEN_SHOULD_SKIP_THIS
50
51namespace gum::learning {
52
54 INLINE BDeuPrior::BDeuPrior(const DatabaseTable& database,
55 const Bijection< NodeId, std::size_t >& nodeId2columns) :
56 Prior(database, nodeId2columns) {
57 GUM_CONSTRUCTOR(BDeuPrior)
58 }
59
61 INLINE BDeuPrior::BDeuPrior(const BDeuPrior& from) : Prior(from) { GUM_CONS_CPY(BDeuPrior) }
62
64 INLINE BDeuPrior::BDeuPrior(BDeuPrior&& from) noexcept : Prior(std::move(from)) {
65 GUM_CONS_MOV(BDeuPrior)
66 }
67
69 INLINE BDeuPrior* BDeuPrior::clone() const { return new BDeuPrior(*this); }
70
72 INLINE BDeuPrior::~BDeuPrior() { GUM_DESTRUCTOR(BDeuPrior) }
73
75 INLINE BDeuPrior& BDeuPrior::operator=(const BDeuPrior& from) {
76 Prior::operator=(from);
77 return *this;
78 }
79
81 INLINE BDeuPrior& BDeuPrior::operator=(BDeuPrior&& from) noexcept {
82 Prior::operator=(std::move(from));
83 return *this;
84 }
85
87 INLINE void BDeuPrior::setWeight(const double weight) {
88 if (weight < 0.0) {
89 GUM_ERROR(OutOfBounds, "A negative weight (" << weight << ") is forbidden for the BDeu prior")
90 }
91 this->weight_ = weight;
92 }
93
95 INLINE void BDeuPrior::setEffectiveSampleSize(const double weight) { setWeight(weight); }
96
98 INLINE PriorType BDeuPrior::getType() const { return PriorType::BDeuPriorType; }
99
101 INLINE bool BDeuPrior::isInformative() const { return this->weight_ != 0.0; }
102
104 INLINE void BDeuPrior::addJointPseudoCount(const IdCondSet& idset,
105 std::vector< double >& counts) {
106 // if the idset is empty or the weight is zero, the prior is also empty
107 if (idset.empty() || (this->weight_ == 0.0)) return;
108
109 // otherwise, add the weight to all the cells in the counting vector
110 const double weight = this->weight_ / double(counts.size());
111 for (auto& count: counts)
112 count += weight;
113 }
114
115
116} // namespace gum::learning
117
118#endif /* DOXYGEN_SHOULD_SKIP_THIS */
the internal prior for the BDeu score (N' / (r_i * q_i)
Exception : out of bound.
BDeuPrior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
The class representing a tabular database as used by learning tasks.
the base class for all a priori
Definition prior.h:83
#define GUM_ERROR(type, msg)
Definition exceptions.h:72
include the inlined functions if necessary
Definition CSVParser.h:54