kNML.h

Go to the documentation of this file.

/****************************************************************************
 *   This file is part of the aGrUM/pyAgrum library.                        *
 *                                                                          *
 *   Copyright (c) 2005-2026 by                                             *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *                                                                          *
 *   The aGrUM/pyAgrum library is free software; you can redistribute it    *
 *   and/or modify it under the terms of either :                           *
 *                                                                          *
 *    - the GNU Lesser General Public License as published by               *
 *      the Free Software Foundation, either version 3 of the License,      *
 *      or (at your option) any later version,                              *
 *    - the MIT license (MIT),                                              *
 *    - or both in dual license, as here.                                   *
 *                                                                          *
 *   (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html)    *
 *                                                                          *
 *   This aGrUM/pyAgrum library is distributed in the hope that it will be  *
 *   useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,          *
 *   INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
 *   FOR A PARTICULAR PURPOSE  AND NONINFRINGEMENT. IN NO EVENT SHALL THE   *
 *   AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
 *   LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,        *
 *   ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR  *
 *   OTHER DEALINGS IN THE SOFTWARE.                                        *
 *                                                                          *
 *   See LICENCES for more details.                                         *
 *                                                                          *
 *   SPDX-FileCopyrightText: Copyright 2005-2026                            *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *   SPDX-License-Identifier: LGPL-3.0-or-later OR MIT                      *
 *                                                                          *
 *   Contact  : info_at_agrum_dot_org                                       *
 *   homepage : http://agrum.gitlab.io                                      *
 *   gitlab   : https://gitlab.com/agrumery/agrum                           *
 *                                                                          *
 ****************************************************************************/
 

 
#ifndef GUM_LEARNING_K_NML_H
#define GUM_LEARNING_K_NML_H
 
#include <vector>
 
#include <agrum/base/core/math/variableLog2ParamComplexity.h>
#include <agrum/base/stattests/cachedContingencyCounter.h>
 
namespace gum {
 
  namespace learning {
 

    class KNML: public CachedContingencyCounter {
      public:
      // ##########################################################################
      // ##########################################################################


      KNML(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 >());
 


      KNML(const DBRowGeneratorParser&             parser,
           const Prior&                            prior,
           const Bijection< NodeId, std::size_t >& nodeId2columns
           = Bijection< NodeId, std::size_t >());

      KNML(const KNML& from);

      KNML(KNML&& from);

      [[nodiscard]] virtual KNML* clone() const;

      ~KNML() override;

 
 
      // ##########################################################################
      // ##########################################################################


      KNML& operator=(const KNML& from);

      KNML& operator=(KNML&& from);

 
 
      // ##########################################################################
      // ##########################################################################

      double score(NodeId var1, NodeId var2);

      double score(NodeId var1, NodeId var2, const std::vector< NodeId >& rhs_ids);

      void clear() override;

      void clearCache() override;

      void useCache(const bool on_off) override;

 
 
#ifndef DOXYGEN_SHOULD_SKIP_THIS
 
      private:
      VariableLog2ParamComplexity _param_complexity_;

      double _score_(const IdCondSet& idset);
 
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
    };
 
  } /* namespace learning */
 
} /* namespace gum */
 
// include the inlined functions if necessary
#ifndef GUM_NO_INLINE
#  include <agrum/base/stattests/kNML_inl.h>
#endif /* GUM_NO_INLINE */
 
#endif /* GUM_LEARNING_K_NML_H */