47#ifndef GUM_LEARNING_PRIOR_BDEU_H
48#define GUM_LEARNING_PRIOR_BDEU_H
the internal prior for the BDeu score (N' / (r_i * q_i)
void setEffectiveSampleSize(double weight)
sets the effective sample size N'
BDeuPrior * clone() const override
virtual copy constructor
BDeuPrior(const BDeuPrior &from)
copy constructor
bool isInformative() const final
indicates whether the prior is tensorly informative
BDeuPrior(BDeuPrior &&from) noexcept
move constructor
void addConditioningPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vector defined over the right hand side of the idset
void addJointPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vector corresponding to the idset
BDeuPrior & operator=(const BDeuPrior &from)
copy operator
BDeuPrior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
PriorType getType() const final
returns the type of the prior
virtual ~BDeuPrior()
destructor
BDeuPrior & operator=(BDeuPrior &&from) noexcept
move operator
void setWeight(double weight) final
sets the effective sample size N' (alias of setEffectiveSampleSize ())
The class representing a tabular database as used by learning tasks.
A class for storing a pair of sets of NodeIds, the second one corresponding to a conditional set.
Prior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
double weight() const
returns the weight assigned to the prior
include the inlined functions if necessary
the base class for all a priori