aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
smoothingPrior_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
48#ifndef DOXYGEN_SHOULD_SKIP_THIS
49
50namespace gum {
51
52 namespace learning {
53
55 INLINE
57 const Bijection< NodeId, std::size_t >& nodeId2columns) :
58 Prior(database, nodeId2columns) {
59 GUM_CONSTRUCTOR(SmoothingPrior);
60 }
61
63 INLINE SmoothingPrior::SmoothingPrior(const SmoothingPrior& from) : Prior(from) {
64 GUM_CONS_CPY(SmoothingPrior);
65 }
66
68 INLINE SmoothingPrior::SmoothingPrior(SmoothingPrior&& from) noexcept : Prior(std::move(from)) {
69 GUM_CONS_MOV(SmoothingPrior);
70 }
71
73 INLINE SmoothingPrior* SmoothingPrior::clone() const { return new SmoothingPrior(*this); }
74
76 INLINE SmoothingPrior::~SmoothingPrior() { GUM_DESTRUCTOR(SmoothingPrior); }
77
79 INLINE SmoothingPrior& SmoothingPrior::operator=(const SmoothingPrior& from) {
80 Prior::operator=(from);
81 return *this;
82 }
83
85 INLINE SmoothingPrior& SmoothingPrior::operator=(SmoothingPrior&& from) {
86 Prior::operator=(std::move(from));
87 return *this;
88 }
89
91 INLINE PriorType SmoothingPrior::getType() const { return PriorType::SmoothingPriorType; }
92
94 INLINE bool SmoothingPrior::isInformative() const { return this->weight_ != 0.0; }
95
97 INLINE void SmoothingPrior::addJointPseudoCount(const IdCondSet& idset,
98 std::vector< double >& counts) {
99 // if the idset is empty or the weight is zero, the prior is also empty
100 if (idset.empty() || (this->weight_ == 0.0)) return;
101
102 // otherwise, add the weight to all the cells in the counting vector
103 for (auto& count: counts)
104 count += this->weight_;
105 }
106
107 } /* namespace learning */
108
109} /* namespace gum */
110
111#endif /* DOXYGEN_SHOULD_SKIP_THIS */
The class representing a tabular database as used by learning tasks.
the base class for all a priori
Definition prior.h:83
SmoothingPrior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
include the inlined functions if necessary
Definition CSVParser.h:54
gum is the global namespace for all aGrUM entities
Definition agrum.h:46