scoreBDeu.h

Go to the documentation of this file.

/**
 *
 *   Copyright (c) 2005-2021 by Pierre-Henri WUILLEMIN(@LIP6) & Christophe GONZALES(@AMU)
 *   info_at_agrum_dot_org
 *
 *  This library is free software: you can redistribute it and/or modify
 *  it under the terms of 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.
 *
 *  This library is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with this library.  If not, see <http://www.gnu.org/licenses/>.
 *
 */


/** @file
 * @brief the class for computing BDeu scores
 *
 * @author Christophe GONZALES(@AMU) and Pierre-Henri WUILLEMIN(@LIP6)
 */

#ifndef GUM_LEARNING_SCORE_BDEU_H
#define GUM_LEARNING_SCORE_BDEU_H

#include <string>

#include <agrum/agrum.h>
#include <agrum/tools/core/math/math_utils.h>
#include <agrum/tools/core/math/gammaLog2.h>
#include <agrum/BN/learning/scores_and_tests/score.h>
#include <agrum/BN/learning/aprioris/aprioriBDeu.h>

namespace gum {

  namespace learning {

    /** @class ScoreBDeu
     * @brief the class for computing BDeu scores
     * @headerfile scoreBDeu.h <agrum/BN/learning/scores_and_tests/scoreBDeu.h>
     * @ingroup learning_scores
     *
     * @warning As BDeu already includes an implicit smoothing apriori on all
     * the cells of contingency tables, the apriori passed to the score should
     * be a NoApriori. But aGrUM will let you use another (certainly incompatible)
     * apriori with the score. In this case, this apriori will be included in
     * addition to the implicit smoothing apriori in a BD fashion, i.e., we
     * will ressort to the Bayesian Dirichlet (BD) formula to include the sum of
     * the two aprioris into the score.
     *
     */
    template < template < typename > class ALLOC = std::allocator >
    class ScoreBDeu: public Score< ALLOC > {
      public:
      /// type for the allocators passed in arguments of methods
      using allocator_type = ALLOC< NodeId >;

      // ##########################################################################
      /// @name Constructors / Destructors
      // ##########################################################################
      /// @{

      /// default constructor
      /** @param parser the parser used to parse the database
       * @param apriori An apriori that we add to the computation of the score
       * @param ranges a set of pairs {(X1,Y1),...,(Xn,Yn)} of database's rows
       * indices. The countings are then performed only on the union of the
       * rows [Xi,Yi), i in {1,...,n}. This is useful, e.g, when performing
       * cross validation tasks, in which part of the database should be ignored.
       * An empty set of ranges is equivalent to an interval [X,Y) ranging over
       * the whole database.
       * @param nodeId2Columns a mapping from the ids of the nodes in the
       * graphical model to the corresponding column in the DatabaseTable
       * parsed by the parser. This enables estimating from a database in
       * which variable A corresponds to the 2nd column the parameters of a BN
       * in which variable A has a NodeId of 5. An empty nodeId2Columns
       * bijection means that the mapping is an identity, i.e., the value of a
       * NodeId is equal to the index of the column in the DatabaseTable.
       * @param alloc the allocator used to allocate the structures within the
       * Score.
       * @warning If nodeId2columns is not empty, then only the scores over the
       * ids belonging to this bijection can be computed: applying method
       * score() over other ids will raise exception NotFound. */
      ScoreBDeu(const DBRowGeneratorParser< ALLOC >&                                 parser,
                const Apriori< ALLOC >&                                              apriori,
                const std::vector< std::pair< std::size_t, std::size_t >,
                                   ALLOC< std::pair< std::size_t, std::size_t > > >& ranges,
                const Bijection< NodeId, std::size_t, ALLOC< std::size_t > >&        nodeId2columns
                = Bijection< NodeId, std::size_t, ALLOC< std::size_t > >(),
                const allocator_type& alloc = allocator_type());


      /// default constructor
      /** @param parser the parser used to parse the database
       * @param apriori An apriori that we add to the computation of the score
       * @param nodeId2Columns a mapping from the ids of the nodes in the
       * graphical model to the corresponding column in the DatabaseTable
       * parsed by the parser. This enables estimating from a database in
       * which variable A corresponds to the 2nd column the parameters of a BN
       * in which variable A has a NodeId of 5. An empty nodeId2Columns
       * bijection means that the mapping is an identity, i.e., the value of a
       * NodeId is equal to the index of the column in the DatabaseTable.
       * @param alloc the allocator used to allocate the structures within the
       * Score.
       * @warning If nodeId2columns is not empty, then only the scores over the
       * ids belonging to this bijection can be computed: applying method
       * score() over other ids will raise exception NotFound. */
      ScoreBDeu(const DBRowGeneratorParser< ALLOC >&                          parser,
                const Apriori< ALLOC >&                                       apriori,
                const Bijection< NodeId, std::size_t, ALLOC< std::size_t > >& nodeId2columns
                = Bijection< NodeId, std::size_t, ALLOC< std::size_t > >(),
                const allocator_type& alloc = allocator_type());

      /// copy constructor
      ScoreBDeu(const ScoreBDeu< ALLOC >& from);

      /// copy constructor with a given allocator
      ScoreBDeu(const ScoreBDeu< ALLOC >& from, const allocator_type& alloc);

      /// move constructor
      ScoreBDeu(ScoreBDeu< ALLOC >&& from);

      /// move constructor with a given allocator
      ScoreBDeu(ScoreBDeu< ALLOC >&& from, const allocator_type& alloc);

      /// virtual copy constructor
      virtual ScoreBDeu< ALLOC >* clone() const;

      /// virtual copy constructor with a given allocator
      virtual ScoreBDeu< ALLOC >* clone(const allocator_type& alloc) const;

      /// destructor
      virtual ~ScoreBDeu();

      /// @}


      // ##########################################################################
      /// @name Operators
      // ##########################################################################

      /// @{

      /// copy operator
      ScoreBDeu< ALLOC >& operator=(const ScoreBDeu< ALLOC >& from);

      /// move operator
      ScoreBDeu< ALLOC >& operator=(ScoreBDeu< ALLOC >&& from);

      /// @}


      // ##########################################################################
      /// @name Accessors / Modifiers
      // ##########################################################################
      /// @{

      /// indicates whether the apriori is compatible (meaningful) with the score
      /** The combination of some scores and aprioris can be meaningless. For
       * instance, adding a Dirichlet apriori to the K2 score is not very
       * meaningful since K2 corresponds to a BD score with a 1-smoothing
       * apriori.
       * aGrUM allows you to perform such combination, but you can check with
       * method isAprioriCompatible () whether the result the score will give
       * you is meaningful or not.
       * @returns a non empty string if the apriori is compatible with the
       * score.*/
      virtual std::string isAprioriCompatible() const final;

      /// returns the internal apriori of the score
      /** Some scores include an apriori. For instance, the K2 score is a BD
       * score with a Laplace Apriori ( smoothing(1) ). BDeu is a BD score with
       * a N'/(r_i * q_i) apriori, where N' is an effective sample size and r_i
       * is the domain size of the target variable and q_i is the domain size of
       * the Cartesian product of its parents. The goal of the score's internal
       * apriori classes is to enable to account for these aprioris outside the
       * score, e.g., when performing parameter estimation. It is important to
       * note that, to be meaningful, a structure + parameter learning requires
       * that the same aprioris are taken into account during structure learning
       * and parameter learning. */
      virtual const Apriori< ALLOC >& internalApriori() const final;

      /// sets the effective sample size of the internal apriori
      void setEffectiveSampleSize(double ess);

      /// @}


      /// indicates whether the apriori is compatible (meaningful) with the score
      /** @returns a non empty string if the apriori is compatible with the score.
       */
      static std::string isAprioriCompatible(const std::string& apriori_type, double weight = 1.0f);

      /// indicates whether the apriori is compatible (meaningful) with the score
      /** a non empty string if the apriori is compatible with the score. */
      static std::string isAprioriCompatible(const Apriori< ALLOC >& apriori);


      protected:
      /// returns the score for a given IdCondSet
      /** @throws OperationNotAllowed is raised if the score does not support
       * calling method score such an idset (due to too many/too few variables
       * in the left hand side or the right hand side of the idset). */
      virtual double score_(const IdCondSet< ALLOC >& idset) final;


#ifndef DOXYGEN_SHOULD_SKIP_THIS

      private:
      /// the internal apriori of the score
      AprioriBDeu< ALLOC > _internal_apriori_;

      /// the log(gamma (n)) function: generalizes log((n-1)!)
      GammaLog2 _gammalog2_;

#endif /* DOXYGEN_SHOULD_SKIP_THIS */
    };

  } /* namespace learning */

} /* namespace gum */


#ifndef GUM_NO_EXTERN_TEMPLATE_CLASS
extern template class gum::learning::ScoreBDeu<>;
#endif


// always include the template implementation
#include <agrum/BN/learning/scores_and_tests/scoreBDeu_tpl.h>

#endif /* GUM_LEARNING_SCORE_BDEU_H */