aGrUM
0.20.2
a C++ library for (probabilistic) graphical models
weightedSampling_tpl.h
Go to the documentation of this file.
1
/**
2
*
3
* Copyright 2005-2020 Pierre-Henri WUILLEMIN(@LIP6) & Christophe GONZALES(@AMU)
4
* info_at_agrum_dot_org
5
*
6
* This library is free software: you can redistribute it and/or modify
7
* it under the terms of the GNU Lesser General Public License as published by
8
* the Free Software Foundation, either version 3 of the License, or
9
* (at your option) any later version.
10
*
11
* This library is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU Lesser General Public License for more details.
15
*
16
* You should have received a copy of the GNU Lesser General Public License
17
* along with this library. If not, see <http://www.gnu.org/licenses/>.
18
*
19
*/
20
21
22
/**
23
* @file
24
* @brief Implementation of Weighted Sampling for inference in Bayesian networks.
25
*
26
* @author Paul ALAM & Pierre-Henri WUILLEMIN(@LIP6)
27
*/
28
29
30
#
include
<
agrum
/
BN
/
inference
/
weightedSampling
.
h
>
31
32
33
namespace
gum
{
34
35
36
/// Default constructor
37
template
<
typename
GUM_SCALAR >
38
WeightedSampling< GUM_SCALAR >::WeightedSampling(
39
const
IBayesNet< GUM_SCALAR >* bn) :
40
SamplingInference< GUM_SCALAR >(bn) {
41
GUM_CONSTRUCTOR(WeightedSampling);
42
}
43
44
45
/// Destructor
46
template
<
typename
GUM_SCALAR
>
47
WeightedSampling
<
GUM_SCALAR
>::~
WeightedSampling
() {
48
GUM_DESTRUCTOR
(
WeightedSampling
);
49
}
50
51
52
/// No burn in needed for Weighted sampling
53
template
<
typename
GUM_SCALAR
>
54
Instantiation
WeightedSampling
<
GUM_SCALAR
>::
burnIn_
() {
55
gum
::
Instantiation
I
;
56
return
I
;
57
}
58
59
60
template
<
typename
GUM_SCALAR
>
61
Instantiation
WeightedSampling
<
GUM_SCALAR
>::
draw_
(
GUM_SCALAR
*
w
,
62
Instantiation
prev
) {
63
*
w
= 1.0f;
64
bool
wrongValue
=
false
;
65
do
{
66
prev
.
clear
();
67
wrongValue
=
false
;
68
*
w
= 1.0f;
69
70
for
(
const
auto
nod
:
this
->
BN
().
topologicalOrder
()) {
71
if
(
this
->
hardEvidenceNodes
().
contains
(
nod
)) {
72
prev
.
add
(
this
->
BN
().
variable
(
nod
));
73
prev
.
chgVal
(
this
->
BN
().
variable
(
nod
),
this
->
hardEvidence
()[
nod
]);
74
auto
localp
=
this
->
BN
().
cpt
(
nod
).
get
(
prev
);
75
76
if
(
localp
== 0) {
77
wrongValue
=
true
;
78
break
;
79
}
80
81
*
w
*=
localp
;
82
}
else
{
83
this
->
addVarSample_
(
nod
, &
prev
);
84
}
85
}
86
}
while
(
wrongValue
);
87
return
prev
;
88
}
89
}
// namespace gum
gum::Set::emplace
INLINE void emplace(Args &&... args)
Definition:
set_tpl.h:669