aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
scoreBIC.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
48#ifndef GUM_LEARNING_SCORE_BIC_H
49#define GUM_LEARNING_SCORE_BIC_H
50
51#include <string>
52
53#include <agrum/agrum.h>
54
57
58namespace gum {
59
60 namespace learning {
61
70 class ScoreBIC: public Score {
71 public:
72 // ##########################################################################
74 // ##########################################################################
76
78
97 const Prior& prior,
98 const std::vector< std::pair< std::size_t, std::size_t > >& ranges,
99 const Bijection< NodeId, std::size_t >& nodeId2columns
101
102
104
117 const Prior& prior,
118 const Bijection< NodeId, std::size_t >& nodeId2columns
120
122 ScoreBIC(const ScoreBIC& from);
123
126
128 [[nodiscard]] ScoreBIC* clone() const override;
129
131 ~ScoreBIC() override;
132
134
135
136 // ##########################################################################
138 // ##########################################################################
139
141
144
147
149
150
151 // ##########################################################################
153 // ##########################################################################
155
157
166 std::string isPriorCompatible() const final;
167
169
179 const Prior& internalPrior() const final;
180
182
190 double N(const IdCondSet& idset);
191
193
194
196
198 static std::string isPriorCompatible(PriorType prior_type, double weight = 1.0f);
199
201
202 static std::string isPriorCompatible(const Prior& prior);
203
204
205 protected:
207
210 double score_(const IdCondSet& idset) final;
211
212
213#ifndef DOXYGEN_SHOULD_SKIP_THIS
214
215 private:
217 NoPrior _internal_prior_;
218
219#endif /* DOXYGEN_SHOULD_SKIP_THIS */
220 };
221
222 } /* namespace learning */
223
224} /* namespace gum */
225
227#ifndef GUM_NO_INLINE
229#endif /* GUM_NO_INLINE */
230
231#endif /* GUM_LEARNING_SCORE_BIC_H */
the class used to read a row in the database and to transform it into a set of DBRow instances that c...
A class for storing a pair of sets of NodeIds, the second one corresponding to a conditional set.
Definition idCondSet.h:214
the no a priorclass: corresponds to 0 weight-sample
Definition noPrior.h:65
the base class for all a priori
Definition prior.h:81
double N(const IdCondSet &idset)
returns the size of the database w.r.t. a given idset
double score_(const IdCondSet &idset) final
returns the score for a given IdCondSet
ScoreBIC & operator=(const ScoreBIC &from)
copy operator
ScoreBIC(const ScoreBIC &from)
copy constructor
ScoreBIC & operator=(ScoreBIC &&from)
move operator
const Prior & internalPrior() const final
returns the internal prior of the score
~ScoreBIC() override
destructor
ScoreBIC * clone() const override
virtual copy constructor
std::string isPriorCompatible() const final
indicates whether the prior is compatible (meaningful) with the score
ScoreBIC(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
ScoreBIC(ScoreBIC &&from)
move constructor
ScoreBIC(const DBRowGeneratorParser &parser, const Prior &prior, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
const std::vector< std::pair< std::size_t, std::size_t > > & ranges() const
returns the current ranges
Score(const DBRowGeneratorParser &parser, const Prior &external_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
include the inlined functions if necessary
Definition CSVParser.h:55
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
STL namespace.
the no a priorclass: corresponds to 0 weight-sample
the class for computing BIC scores
the base class for all the scores used for learning (BIC, BDeu, etc)