25 #ifndef GUM_LEARNING_A_PRIORI_NO_APRIORI_H 26 #define GUM_LEARNING_A_PRIORI_NO_APRIORI_H 42 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/aprioriNoApriori_tpl.h> AprioriNoApriori< ALLOC > & operator=(const AprioriNoApriori< ALLOC > &from)
copy operator
virtual bool isOfType(const std::string &type) final
indicates whether an apriori is of a certain type
AprioriNoApriori(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
virtual const std::string & getType() const final
returns the type of the apriori
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
the base class for all a priori
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
gum is the global namespace for all aGrUM entities
virtual bool isInformative() const final
indicates whether the apriori is potentially informative
double weight() const
returns the weight assigned to the apriori
virtual void setWeight(const double weight) final
sets the weight of the a priori (kind of effective sample size)
Set of pairs of elements with fast search for both elements.
The class representing a tabular database as used by learning tasks.
virtual ~AprioriNoApriori()
destructor
ALLOC< NodeId > allocator_type
type for the allocators passed in arguments of methods
virtual AprioriNoApriori< ALLOC > * clone() const
virtual copy constructor
ALLOC< NodeId > allocator_type
type for the allocators passed in arguments of methods
Size NodeId
Type for node ids.
the no a priori class: corresponds to 0 weight-sample
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 ...