aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
K2.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 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-2025 *
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_K2_H
48#define GUM_LEARNING_K2_H
49
50#include <string>
51#include <vector>
52
54
55namespace gum {
56
57 namespace learning {
58
63 class K2: private GreedyHillClimbing {
64 public:
65 // ##########################################################################
67 // ##########################################################################
69
71 K2();
72
74 K2(const K2& from);
75
77 K2(K2&& from);
78
80 ~K2();
81
83
84 // ##########################################################################
86 // ##########################################################################
88
90 K2& operator=(const K2& from);
91
93 K2& operator=(K2&& from);
94
96
97 // ##########################################################################
99 // ##########################################################################
101
104
107
109 void setOrder(const std::vector< NodeId >& order);
110
112 const Sequence< NodeId >& order() const noexcept;
113
115
121 template < typename GRAPH_CHANGES_SELECTOR >
122 DAG learnStructure(GRAPH_CHANGES_SELECTOR& selector, DAG initial_dag = DAG());
123
125 template < typename GUM_SCALAR, typename GRAPH_CHANGES_SELECTOR, typename PARAM_ESTIMATOR >
126 BayesNet< GUM_SCALAR > learnBN(GRAPH_CHANGES_SELECTOR& selector,
127 PARAM_ESTIMATOR& estimator,
128 DAG initial_dag = DAG());
129
130 private:
133
137 void _checkOrder_(const std::vector< Size >& modal);
139 };
140
141 } /* namespace learning */
142
143} /* namespace gum */
144
146#ifndef GUM_NO_INLINE
148#endif /* GUM_NO_INLINE */
149
152
153#endif /* GUM_LEARNING_K2_H */
The K2 algorithm.
The K2 algorithm.
ApproximationScheme(bool verbosity=false)
Class representing a Bayesian network.
Definition BayesNet.h:93
Base class for dag.
Definition DAG.h:121
const Sequence< NodeId > & order() const noexcept
returns the current order
K2(K2 &&from)
move constructor
K2 & operator=(K2 &&from)
move operator
Sequence< NodeId > _order_
the order on the variable used for learning
Definition K2.h:132
void setOrder(const Sequence< NodeId > &order)
sets the order on the variables
~K2()
destructor
K2()
default constructor
K2 & operator=(const K2 &from)
copy operator
K2(const K2 &from)
copy constructor
void _checkOrder_(const std::vector< Size > &modal)
checks that the order passed to K2 is coherent with the variables as specified by their modalities
DAG learnStructure(GRAPH_CHANGES_SELECTOR &selector, DAG initial_dag=DAG())
learns the structure of a Bayes net
Definition K2_tpl.h:61
void setOrder(const std::vector< NodeId > &order)
sets the order on the variables
ApproximationScheme & approximationScheme()
returns the approximation policy of the learning algorithm
BayesNet< GUM_SCALAR > learnBN(GRAPH_CHANGES_SELECTOR &selector, PARAM_ESTIMATOR &estimator, DAG initial_dag=DAG())
learns the structure and the parameters of a BN
Definition K2_tpl.h:81
The greedy hill learning algorithm (for directed graphs).
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition types.h:74
Size NodeId
Type for node ids.
include the inlined functions if necessary
Definition CSVParser.h:54
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
STL namespace.