28 #ifndef GUM_LEARNING_A_PRIORI_SMOOTHING_H 29 #define GUM_LEARNING_A_PRIORI_SMOOTHING_H 45 template <
template <
typename >
class ALLOC = std::allocator >
128 virtual const std::string&
getType() const final;
148 std::vector<
double, ALLOC<
double > >& counts) final;
156 const
IdSet< ALLOC >& idset,
157 std::vector<
double, ALLOC<
double > >& counts) final;
167 #include <agrum/learning/aprioris/aprioriSmoothing_tpl.h>
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
A class for storing a pair of sets of NodeIds, the second one corresponding to a conditional set...
the base class for all a priori
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
virtual bool isOfType(const std::string &type) final
indicates whether an apriori is of a certain type
virtual bool isInformative() const final
indicates whether the apriori is potentially informative
virtual AprioriSmoothing< ALLOC > * clone() const
virtual copy constructor
virtual ~AprioriSmoothing()
destructor
ALLOC< NodeId > allocator_type
type for the allocators passed in arguments of methods
virtual const std::string & getType() const final
returns the type of the apriori
Set of pairs of elements with fast search for both elements.
The class representing a tabular database as used by learning tasks.
AprioriSmoothing< ALLOC > & operator=(const AprioriSmoothing< ALLOC > &from)
copy operator
the smooth a priori: adds a weight w to all the countings
ALLOC< NodeId > allocator_type
type for the allocators passed in arguments of methods
virtual void addAllApriori(const IdSet< ALLOC > &idset, std::vector< double, ALLOC< double > > &counts) final
adds the apriori to a counting vector corresponding to the idset
AprioriSmoothing(const DatabaseTable< ALLOC > &database, 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
Size NodeId
Type for node ids.
virtual void addConditioningApriori(const IdSet< ALLOC > &idset, std::vector< double, ALLOC< double > > &counts) final
adds the apriori to a counting vectordefined over the right hand side of the idset ...