aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
indepTestChi2_inl.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#pragma once
41
42
48
49#ifndef DOXYGEN_SHOULD_SKIP_THIS
50
52
53namespace gum {
54
55 namespace learning {
56
59 const DBRowGeneratorParser& parser,
60 const Prior& prior,
61 const std::vector< std::pair< std::size_t, std::size_t > >& ranges,
62 const Bijection< NodeId, std::size_t >& nodeId2columns) :
63 IndependenceTest(parser, prior, ranges, nodeId2columns),
64 _domain_sizes_(parser.database().domainSizes()), _chi2_(_domain_sizes_) {
65 GUM_CONSTRUCTOR(IndepTestChi2);
66 }
67
69 INLINE IndepTestChi2::IndepTestChi2(const DBRowGeneratorParser& parser,
70 const Prior& prior,
71 const Bijection< NodeId, std::size_t >& nodeId2columns) :
72 IndependenceTest(parser, prior, nodeId2columns),
73 _domain_sizes_(parser.database().domainSizes()), _chi2_(_domain_sizes_) {
74 GUM_CONSTRUCTOR(IndepTestChi2);
75 }
76
78 INLINE IndepTestChi2::IndepTestChi2(const IndepTestChi2& from) :
79 IndependenceTest(from), _domain_sizes_(from._domain_sizes_), _chi2_(_domain_sizes_) {
80 GUM_CONS_CPY(IndepTestChi2);
81 }
82
84 INLINE IndepTestChi2::IndepTestChi2(IndepTestChi2&& from) :
85 IndependenceTest(std::move(from)), _domain_sizes_(from._domain_sizes_),
86 _chi2_(_domain_sizes_) {
87 GUM_CONS_MOV(IndepTestChi2);
88 }
89
91 INLINE IndepTestChi2* IndepTestChi2::clone() const { return new IndepTestChi2(*this); }
92
94 INLINE IndepTestChi2::~IndepTestChi2() { GUM_DESTRUCTOR(IndepTestChi2); }
95
97 INLINE std::pair< double, double >
98 IndepTestChi2::statistics(NodeId var1, NodeId var2, const std::vector< NodeId >& rhs_ids) {
99 return statistics_(IdCondSet(var1, var2, rhs_ids, false));
100 }
101
103 INLINE double IndepTestChi2::score_(const IdCondSet& idset) {
104 const auto& nodeId2cols = this->counter_.nodeId2Columns();
105 Idx var_x, var_y;
106 if (nodeId2cols.empty()) {
107 var_x = idset[0];
108 var_y = idset[1];
109 } else {
110 var_x = nodeId2cols.second(idset[0]);
111 var_y = nodeId2cols.second(idset[1]);
112 }
113
114 auto stat = statistics_(idset); // stat contains pair(Chi2stat,pValue)
115 double score = stat.first;
116
117 // ok, here, score contains the value of the chi2 formula.
118 // To get a meaningful score, we shall compute the critical values
119 // for the Chi2 distribution and assign as the score of
120 // (score - alpha ) / alpha, where alpha is the critical value
121 const double alpha = _chi2_.criticalValue(var_x, var_y);
122 score = (score - alpha) / alpha;
123
124 return score;
125 }
126
127 } /* namespace learning */
128
129} /* namespace gum */
130
131#endif /* DOXYGEN_SHOULD_SKIP_THIS */
the class used to read a row in the database and to transform it into a set of DBRow instances that c...
IndepTestChi2(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
The base class for all the independence tests used for learning.
the base class for all a priori
Definition prior.h:83
A class used by learning caches to represent uniquely sets of variables.
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.