aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
DirichletPriorFromDatabase.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_DIRICHLET_FROM_DATABASE_H
48
#define GUM_LEARNING_PRIOR_DIRICHLET_FROM_DATABASE_H
49
50
#include <vector>
51
52
#include <
agrum/agrum.h
>
53
54
#include <
agrum/base/stattests/priors/prior.h
>
55
#include <
agrum/base/stattests/recordCounter.h
>
56
57
namespace
gum
{
58
59
namespace
learning
{
60
66
class
GUM_SHARED_PUBLIC
DirichletPriorFromDatabase
:
public
Prior
{
67
public
:
68
// ##########################################################################
70
// ##########################################################################
72
74
91
DirichletPriorFromDatabase
(
const
DatabaseTable
& learning_db,
92
const
DBRowGeneratorParser
& prior_parser,
93
const
Bijection< NodeId, std::size_t >
& nodeId2columns
94
=
Bijection< NodeId, std::size_t >
());
95
97
DirichletPriorFromDatabase
(
const
DirichletPriorFromDatabase
& from);
98
100
DirichletPriorFromDatabase
(
DirichletPriorFromDatabase
&& from)
noexcept
;
101
103
[[nodiscard]]
DirichletPriorFromDatabase
*
clone
()
const override
;
104
106
~DirichletPriorFromDatabase
()
override
;
107
109
110
111
// ##########################################################################
113
// ##########################################################################
115
117
DirichletPriorFromDatabase
&
operator=
(
const
DirichletPriorFromDatabase
& from);
118
120
DirichletPriorFromDatabase
&
operator=
(
DirichletPriorFromDatabase
&& from);
121
123
124
125
// ##########################################################################
127
// ##########################################################################
129
131
PriorType
getType
() const final;
132
134
141
bool
isInformative
() const final;
142
144
void
setWeight
(
double
weight
) final;
145
147
152
void
addJointPseudoCount
(const
IdCondSet
& idset,
std
::vector<
double
>& counts) final;
153
159
void
addConditioningPseudoCount
(const
IdCondSet
& idset,
std
::vector<
double
>& counts) final;
160
162
163
164
#ifndef DOXYGEN_SHOULD_SKIP_THIS
165
166
private
:
167
// the record counter used to parse the prior database
168
RecordCounter
_counter_;
169
170
// the internal weight is equal to weight_ / nb rows of prior database
171
// this internal weight is used to ensure that assigning a weight of 1
172
// to the prior is equivalent to adding just one row to the learning
173
// database
174
double
_internal_weight_;
175
176
#endif
/* DOXYGEN_SHOULD_SKIP_THIS */
177
};
178
179
}
/* namespace learning */
180
181
}
/* namespace gum */
182
183
// include the inlined functions if necessary
184
#ifndef GUM_NO_INLINE
185
# include <
agrum/base/stattests/priors/DirichletPriorFromDatabase_inl.h
>
186
#endif
/* GUM_NO_INLINE */
187
188
#endif
/* GUM_LEARNING_PRIOR_DIRICHLET_FROM_DATABASE_H */
DirichletPriorFromDatabase_inl.h
A dirichlet priori: computes its N'_ijk from a database.
agrum.h
gum::Bijection< NodeId, std::size_t >
gum::learning::DBRowGeneratorParser
the class used to read a row in the database and to transform it into a set of DBRow instances that c...
Definition
DBRowGeneratorParser.h:84
gum::learning::DatabaseTable
The class representing a tabular database as used by learning tasks.
Definition
databaseTable.h:200
gum::learning::DirichletPriorFromDatabase::operator=
DirichletPriorFromDatabase & operator=(const DirichletPriorFromDatabase &from)
copy operator
gum::learning::DirichletPriorFromDatabase::~DirichletPriorFromDatabase
~DirichletPriorFromDatabase() override
destructor
gum::learning::DirichletPriorFromDatabase::setWeight
void setWeight(double weight) final
sets the weight of the a prior(kind of effective sample size)
gum::learning::DirichletPriorFromDatabase::addConditioningPseudoCount
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
gum::learning::DirichletPriorFromDatabase::getType
PriorType getType() const final
returns the type of the prior
gum::learning::DirichletPriorFromDatabase::clone
DirichletPriorFromDatabase * clone() const override
virtual copy constructor
gum::learning::DirichletPriorFromDatabase::DirichletPriorFromDatabase
DirichletPriorFromDatabase(const DirichletPriorFromDatabase &from)
copy constructor
gum::learning::DirichletPriorFromDatabase::DirichletPriorFromDatabase
DirichletPriorFromDatabase(const DatabaseTable &learning_db, const DBRowGeneratorParser &prior_parser, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
gum::learning::DirichletPriorFromDatabase::isInformative
bool isInformative() const final
indicates whether the prior is potentially informative
gum::learning::DirichletPriorFromDatabase::operator=
DirichletPriorFromDatabase & operator=(DirichletPriorFromDatabase &&from)
move operator
gum::learning::DirichletPriorFromDatabase::DirichletPriorFromDatabase
DirichletPriorFromDatabase(DirichletPriorFromDatabase &&from) noexcept
move constructor
gum::learning::DirichletPriorFromDatabase::addJointPseudoCount
void addJointPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vector corresponding to the idset
gum::learning::IdCondSet
A class for storing a pair of sets of NodeIds, the second one corresponding to a conditional set.
Definition
idCondSet.h:214
gum::learning::Prior::Prior
Prior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
gum::learning::Prior::weight
double weight() const
returns the weight assigned to the prior
gum::learning::RecordCounter
The class that computes counting of observations from the database.
Definition
recordCounter.h:127
gum::learning
include the inlined functions if necessary
Definition
CSVParser.h:55
gum::learning::PriorType
PriorType
Definition
prior.h:59
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
std
STL namespace.
prior.h
the base class for all a priori
recordCounter.h
The class that computes counting of observations from the database.
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0