aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
smoothingPrior.cpp
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
48
50
51#ifndef DOXYGEN_SHOULD_SKIP_THIS
52
54# ifdef GUM_NO_INLINE
56# endif /* GUM_NO_INLINE */
57
58namespace gum::learning {
59
62 std::vector< double >& counts) {
63 // if the conditioning set is empty or the weight is equal to zero,
64 // the prior is also empty
65 if ((idset.size() == idset.nbLHSIds()) || (this->weight_ == 0.0)
66 || (idset.nbLHSIds() == std::size_t(0)))
67 return;
68
69 // compute the weight of the conditioning set
70 double weight = this->weight_;
71 if (this->nodeId2columns_.empty()) {
72 for (auto i = std::size_t(0); i < idset.nbLHSIds(); ++i) {
73 weight *= double(this->database_->domainSize(idset[i]));
74 }
75 } else {
76 for (auto i = std::size_t(0); i < idset.nbLHSIds(); ++i) {
77 weight *= double(this->database_->domainSize(this->nodeId2columns_.second(idset[i])));
78 }
79 }
80
81 // add the weight to the counting vector
82 for (auto& count: counts)
83 count += weight;
84 }
85
86} // namespace gum::learning
87
88#endif /* DOXYGEN_SHOULD_SKIP_THIS */
A class for storing a pair of sets of NodeIds, the second one corresponding to a conditional set.
Definition idCondSet.h:214
const DatabaseTable * database_
a reference to the database in order to have access to its variables
Definition prior.h:161
double weight_
the weight of the prior
Definition prior.h:158
Bijection< NodeId, std::size_t > nodeId2columns_
a mapping from the NodeIds of the variables to the indices of the columns in the database
Definition prior.h:165
double weight() const
returns the weight assigned to the prior
virtual void addConditioningPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vectordefined over the right hand side of the idset
include the inlined functions if necessary
Definition CSVParser.h:54
the smooth a priori: adds a weight w to all the counts
the smooth a priori: adds a weight w to all the counts