47#ifndef GUM_LEARNING_SCORE_H
48#define GUM_LEARNING_SCORE_H
96 const Prior& external_prior,
97 const std::vector< std::pair< std::size_t, std::size_t > >&
ranges,
117 const Prior& external_prior,
169 void setRanges(
const std::vector< std::pair< std::size_t, std::size_t > >& new_ranges);
175 const std::vector< std::pair< std::size_t, std::size_t > >&
ranges()
const;
184 double score(
const NodeId var,
const std::vector< NodeId >& rhs_ids);
277 const std::vector< double >& N_xyz)
const;
the class used to read a row in the database and to transform it into a set of DBRow instances that c...
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.
the base class for all a priori
The class that computes counting of observations from the database.
Prior * prior_
the expert knowledge a priorwe add to the score
virtual std::string isPriorCompatible() const =0
indicates whether the prior is compatible (meaningful) with the score
virtual bool isGumNumberOfThreadsOverriden() const
indicates whether the user set herself the number of threads
void clearRanges()
reset the ranges to the one range corresponding to the whole database
virtual ~Score()
destructor
const std::vector< std::pair< std::size_t, std::size_t > > & ranges() const
returns the current ranges
void clear()
clears all the data structures from memory, including the cache
virtual const Prior & internalPrior() const =0
returns the internal prior of the score
double score(const NodeId var)
returns the score of a single node
Score(const DBRowGeneratorParser &parser, const Prior &external_prior, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
virtual Size getNumberOfThreads() const
returns the current max number of threads of the scheduler
Score(Score &&from)
move constructor
const DatabaseTable & database() const
return the database used by the score
Score & operator=(const Score &from)
copy operator
virtual std::size_t minNbRowsPerThread() const
returns the minimum of rows that each thread should process
const Bijection< NodeId, std::size_t > & nodeId2Columns() const
return the mapping between the columns of the database and the node ids
const std::vector< NodeId > empty_ids_
an empty vector
RecordCounter counter_
the record counter used for the counts over discrete variables
double score(const NodeId var, const std::vector< NodeId > &rhs_ids)
returns the score of a single node given some other nodes
bool isUsingCache() const
indicates whether the score uses a cache
const double one_log2_
1 / log(2)
Score(const Score &from)
copy constructor
void setRanges(const std::vector< std::pair< std::size_t, std::size_t > > &new_ranges)
sets new ranges to perform the counts used by the score
virtual double score_(const IdCondSet &idset)=0
returns the score for a given IdCondSet
std::vector< double > marginalize_(const NodeId X_id, const std::vector< double > &N_xyz) const
returns a counting vector where variables are marginalized from N_xyz
bool use_cache_
a Boolean indicating whether we wish to use the cache
ScoringCache cache_
the scoring cache
virtual void setNumberOfThreads(Size nb)
sets the number max of threads that can be used
virtual void setMinNbRowsPerThread(const std::size_t nb) const
changes the number min of rows a thread should process in a multithreading context
virtual Score * clone() const =0
virtual copy constructor
Score(const DBRowGeneratorParser &parser, const Prior &external_prior, const std::vector< std::pair< std::size_t, std::size_t > > &ranges, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
void clearCache()
clears the current cache
void useCache(const bool on_off)
turn on/off the use of a cache of the previously computed score
Score & operator=(Score &&from)
move operator
a cache for caching scores and independence tests results
the classes to account for structure changes in a graph
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the base class for all a priori
The class that computes counting of observations from the database.
the base class for all the scores used for learning (BIC, BDeu, etc)
a cache for caching scores and independence tests results