47#ifndef GUM_LEARNING_PRIOR_SMOOTHING_H
48#define GUM_LEARNING_PRIOR_SMOOTHING_H
148 std::vector<
double >& counts) final;
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
virtual void addJointPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vector corresponding to the idset
SmoothingPrior & operator=(SmoothingPrior &&from)
move operator
virtual void addConditioningPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vectordefined over the right hand side of the idset
SmoothingPrior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
SmoothingPrior(const SmoothingPrior &from)
copy constructor
SmoothingPrior & operator=(const SmoothingPrior &from)
copy operator
SmoothingPrior * clone() const override
virtual copy constructor
virtual bool isInformative() const final
indicates whether the prior is tensorly informative
PriorType getType() const final
returns the type of the prior
SmoothingPrior(SmoothingPrior &&from) noexcept
move constructor
virtual ~SmoothingPrior()
destructor
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the base class for all a priori
the smooth a priori: adds a weight w to all the counts