correctedMutualInformation.h

Go to the documentation of this file.

/****************************************************************************
 *   This file is part of the aGrUM/pyAgrum library.                        *
 *                                                                          *
 *   Copyright (c) 2005-2025 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-2025                            *
 *       - 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_CORRECTED_MUTUAL_INFORMATION_H
#define GUM_LEARNING_CORRECTED_MUTUAL_INFORMATION_H
 
#include <vector>
 
#include <agrum/config.h>
 
#include <agrum/base/stattests/kNML.h>
 
#include <agrum/BN/learning/scores_and_tests/scoreLog2Likelihood.h>
#include <agrum/BN/learning/scores_and_tests/scoreMDL.h>
 
namespace gum {
  namespace learning {
    class CorrectedMutualInformation: public IThreadNumberManager {
      public:
      // ##########################################################################
      // ##########################################################################


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


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

      CorrectedMutualInformation(const CorrectedMutualInformation& from);

      CorrectedMutualInformation(CorrectedMutualInformation&& from);

      virtual CorrectedMutualInformation* clone() const;

      virtual ~CorrectedMutualInformation();

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


      CorrectedMutualInformation& operator=(const CorrectedMutualInformation& from);

      CorrectedMutualInformation& operator=(CorrectedMutualInformation&& from);

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

      virtual void clear();


      virtual void clearCache();


      virtual void useCache(bool on_off);

      void useICache(bool on_off);

      void clearICache();

      void useHCache(bool on_off);

      void clearHCache();

      void useKCache(bool on_off);

      void clearKCache();

      void useCnrCache(bool on_off);

      void clearCnrCache();

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

      double score(NodeId var1, NodeId var2);

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

      double score(NodeId var1, NodeId var2, NodeId var3);

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

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

      void useMDL();

      void useNML();

      void useNoCorr();

      virtual void setNumberOfThreads(Size nb);

      virtual std::size_t getNumberOfThreads() const;

      virtual bool isGumNumberOfThreadsOverriden() const;

      virtual void setMinNbRowsPerThread(const std::size_t nb) const;

      virtual std::size_t minNbRowsPerThread() const;


      void setRanges(const std::vector< std::pair< std::size_t, std::size_t > >& new_ranges);

      void clearRanges();

      const std::vector< std::pair< std::size_t, std::size_t > >& ranges() const;

 

      enum class KModeTypes { MDL, NML, NoCorr };
 
 
#ifndef DOXYGEN_SHOULD_SKIP_THIS
 
      private:
      /* Note that the log2-likelihood is equal to N times the entropy H */
      ScoreLog2Likelihood _NH_;

      KNML _k_NML_;

      ScoreMDL _score_MDL_;

      KModeTypes _kmode_{KModeTypes::MDL};
 


      bool _use_ICache_{true};


      bool _use_HCache_{true};


      bool _use_KCache_{true};


      bool _use_CnrCache_{true};
 

      ScoringCache _ICache_;

      ScoringCache _KCache_;
 

      const std::vector< NodeId > _empty_conditioning_set_;

      const double _threshold_{1e-10};
 

      double _NI_score_(NodeId var_x, NodeId var_y, const std::vector< NodeId >& vars_z);

      double _NI_score_(NodeId                       var_x,
                        NodeId                       var_y,
                        NodeId                       var_z,
                        const std::vector< NodeId >& vars_ui);

      double _K_score_(NodeId var_x, NodeId var_y, const std::vector< NodeId >& vars_z);

      double
          _K_score_(NodeId var_x, NodeId var_y, NodeId var_z, const std::vector< NodeId >& vars_ui);
 
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
    };
 
  } /* namespace learning */
 
} /* namespace gum */
 
// include the inlined functions if necessary
#ifndef GUM_NO_INLINE
#  include <agrum/BN/learning/correctedMutualInformation_inl.h>
#endif /* GUM_NO_INLINE */
 
#endif /* GUM_LEARNING_CORRECTED_MUTUAL_INFORMATION_H */