aGrUM 3.2.0
a C++ library for (probabilistic) graphical models
scoreBDeu_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-2026 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-2026 *
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#pragma once
42
43
49
50#include <agrum/BN/learning/scores/scoreBDeu.h> // to ease IDE parser
51#ifndef DOXYGEN_SHOULD_SKIP_THIS
52
53# include <sstream>
54
56
57namespace gum {
58
59 namespace learning {
60
61 // Constructors and destructor are defined out-of-line in scoreBDeu.cpp
62 // on purpose -- see the comment there.
63
65 INLINE ScoreBDeu* ScoreBDeu::clone() const { return new ScoreBDeu(*this); }
66
68 INLINE std::string ScoreBDeu::isPriorCompatible(const Prior& prior) {
69 return isPriorCompatible(prior.getType(), prior.weight());
70 }
71
73 INLINE std::string ScoreBDeu::isPriorCompatible() const {
74 return isPriorCompatible(*(this->prior_));
75 }
76
78 INLINE const Prior& ScoreBDeu::internalPrior() const { return _internal_prior_; }
79
81 INLINE void ScoreBDeu::setEffectiveSampleSize(double ess) {
82 if (ess < 0) {
83 GUM_ERROR(OutOfBounds,
84 "The effective sample size of the BDeu's "
85 "internal prior must be positive");
86 } else {
87 _internal_prior_.setEffectiveSampleSize(ess);
88 }
89 }
90
91 } /* namespace learning */
92
93} /* namespace gum */
94
95#endif /* DOXYGEN_SHOULD_SKIP_THIS */
the base class for all a priori
Definition prior.h:84
the class for computing BDeu scores
Definition scoreBDeu.h:77
ScoreBDeu * clone() const override
virtual copy constructor
void setEffectiveSampleSize(double ess)
sets the effective sample size of the internal prior
std::string isPriorCompatible() const final
indicates whether the prior is compatible (meaningful) with the score
ScoreBDeu(const DBRowGeneratorParser &parser, const Prior &prior, const std::vector< std::pair< std::size_t, std::size_t > > &ranges, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
const Prior & internalPrior() const final
returns the internal prior of the score
Prior * prior_
the expert knowledge a priorwe add to the score
Definition score.h:238
#define GUM_ERROR(type, msg)
Definition exceptions.h:76
include the inlined functions if necessary
Definition CSVParser.h:55
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
the class for computing BDeu scores