49#ifndef DOXYGEN_SHOULD_SKIP_THIS
62 const std::vector< std::pair< std::size_t, std::size_t > >& ranges,
63 const Bijection< NodeId, std::size_t >& nodeId2columns) :
64 Score(parser, prior, ranges, nodeId2columns),
65 _internal_prior_(parser.database(), nodeId2columns) {
66 GUM_CONSTRUCTOR(ScoreBIC);
70 INLINE ScoreBIC::ScoreBIC(
const DBRowGeneratorParser& parser,
72 const Bijection< NodeId, std::size_t >& nodeId2columns) :
73 Score(parser, prior, nodeId2columns), _internal_prior_(parser.database(), nodeId2columns) {
74 GUM_CONSTRUCTOR(ScoreBIC);
78 INLINE ScoreBIC::ScoreBIC(
const ScoreBIC& from) :
79 Score(from), _internal_prior_(from._internal_prior_) {
80 GUM_CONS_CPY(ScoreBIC);
84 INLINE ScoreBIC::ScoreBIC(ScoreBIC&& from) :
85 Score(
std::move(from)), _internal_prior_(
std::move(from._internal_prior_)) {
86 GUM_CONS_MOV(ScoreBIC);
90 INLINE ScoreBIC* ScoreBIC::clone()
const {
return new ScoreBIC(*
this); }
93 INLINE ScoreBIC::~ScoreBIC() { GUM_DESTRUCTOR(ScoreBIC); }
96 INLINE std::string ScoreBIC::isPriorCompatible(
const Prior& prior) {
97 return isPriorCompatible(prior.getType(), prior.weight());
101 INLINE std::string ScoreBIC::isPriorCompatible()
const {
102 return isPriorCompatible(*(this->prior_));
106 INLINE
const Prior& ScoreBIC::internalPrior()
const {
return _internal_prior_; }
the class used to read a row in the database and to transform it into a set of DBRow instances that c...
the base class for all a priori
ScoreBIC(const DBRowGeneratorParser &parser, const Prior &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
The base class for all the scores used for learning (BIC, BDeu, etc).
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the class for computing BIC scores