aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
K2Prior.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
47
#ifndef GUM_LEARNING_PRIOR_K2_H
48
#define GUM_LEARNING_PRIOR_K2_H
49
50
#include <vector>
51
52
#include <
agrum/agrum.h
>
53
54
#include <
agrum/base/stattests/priors/smoothingPrior.h
>
55
56
namespace
gum
{
57
58
namespace
learning
{
59
71
class
GUM_SHARED_PUBLIC
K2Prior
:
public
SmoothingPrior
{
72
public
:
73
// ##########################################################################
75
// ##########################################################################
77
79
89
explicit
K2Prior
(
const
DatabaseTable
& database,
90
const
Bijection< NodeId, std::size_t >
& nodeId2columns
91
=
Bijection< NodeId, std::size_t >
());
92
94
K2Prior
(
const
K2Prior
& from);
95
97
K2Prior
(
K2Prior
&& from);
98
100
[[nodiscard]]
K2Prior
*
clone
()
const override
;
101
103
~K2Prior
()
override
;
104
106
107
108
// ##########################################################################
110
// ##########################################################################
112
114
K2Prior
&
operator=
(
const
K2Prior
& from);
115
117
K2Prior
&
operator=
(
K2Prior
&& from);
118
120
121
122
// ##########################################################################
124
// ##########################################################################
126
128
void
setWeight
(
const
double
weight
)
final
;
129
131
};
132
133
}
/* namespace learning */
134
135
}
/* namespace gum */
136
137
// include the inlined functions if necessary
138
#ifndef GUM_NO_INLINE
139
# include <
agrum/base/stattests/priors/K2Prior_inl.h
>
140
#endif
/* GUM_NO_INLINE */
141
142
#endif
/* GUM_LEARNING_PRIOR_K2_H */
K2Prior_inl.h
the internal prior for the K2 score = Laplace Prior
agrum.h
gum::Bijection< NodeId, std::size_t >
gum::learning::DatabaseTable
The class representing a tabular database as used by learning tasks.
Definition
databaseTable.h:200
gum::learning::K2Prior::clone
K2Prior * clone() const override
virtual copy constructor
gum::learning::K2Prior::setWeight
void setWeight(const double weight) final
dummy set weight function: in K2, weights are always equal to 1
gum::learning::K2Prior::K2Prior
K2Prior(K2Prior &&from)
move constructor
gum::learning::K2Prior::operator=
K2Prior & operator=(K2Prior &&from)
move operator
gum::learning::K2Prior::operator=
K2Prior & operator=(const K2Prior &from)
copy operator
gum::learning::K2Prior::K2Prior
K2Prior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
gum::learning::K2Prior::~K2Prior
~K2Prior() override
destructor
gum::learning::K2Prior::K2Prior
K2Prior(const K2Prior &from)
copy constructor
gum::learning::Prior::weight
double weight() const
returns the weight assigned to the prior
gum::learning::SmoothingPrior::SmoothingPrior
SmoothingPrior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
gum::learning
include the inlined functions if necessary
Definition
CSVParser.h:55
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
smoothingPrior.h
the smooth a priori: adds a weight w to all the counts
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0