gum::BayesNet< GUM_SCALAR > Class Template Reference

Class representing a Bayesian Network. More...

#include <agrum/BN/BayesNet.h>

Inheritance diagram for gum::BayesNet< GUM_SCALAR >:

Collaboration diagram for gum::BayesNet< GUM_SCALAR >:

Public Member Functions
NodeId	addNoisyAND (const DiscreteVariable &var, GUM_SCALAR external_weight, NodeId id)
	Add a variable, its associate node and a noisyAND implementation. More...
NodeId	addNoisyAND (const DiscreteVariable &var, GUM_SCALAR external_weight)
	Add a variable, its associate node and a noisyAND implementation. More...
NodeId	addLogit (const DiscreteVariable &var, GUM_SCALAR external_weight, NodeId id)
	Add a variable, its associate node and a Logit implementation. More...
NodeId	addLogit (const DiscreteVariable &var, GUM_SCALAR external_weight)
	Add a variable, its associate node and a Logit implementation. More...
NodeId	addOR (const DiscreteVariable &var)
	Add a variable, it's associate node and an OR implementation. More...
NodeId	addAND (const DiscreteVariable &var)
	Add a variable, it's associate node and an AND implementation. More...
void	addWeightedArc (NodeId tail, NodeId head, GUM_SCALAR causalWeight)
	Add an arc in the BN, and update arc.head's CPT. More...
void	addWeightedArc (const std::string &tail, const std::string &head, GUM_SCALAR causalWeight)
	Add an arc in the BN, and update arc.head's CPT. More...
void	generateCPTs () const
	randomly generates CPTs for a given structure More...
void	generateCPT (NodeId node) const
	randomly generate CPT for a given node in a given structure More...
void	generateCPT (const std::string &name) const
void	changePotential (NodeId id, Potential< GUM_SCALAR > *newPot)
	change the CPT associated to nodeId to newPot delete the old CPT associated to nodeId. More...
void	changePotential (const std::string &name, Potential< GUM_SCALAR > *newPot)
bool	operator== (const IBayesNet< GUM_SCALAR > &from) const
	This operator compares 2 BNs ! More...
bool	operator!= (const IBayesNet< GUM_SCALAR > &from) const
Size	dim () const
	Returns the dimension (the number of free parameters) in this bayes net. More...
Size	maxVarDomainSize () const
GUM_SCALAR	minParam () const
GUM_SCALAR	maxParam () const
GUM_SCALAR	minNonZeroParam () const
GUM_SCALAR	maxNonOneParam () const
virtual std::string	toDot () const
std::string	toString () const
NodeSet	minimalCondSet (NodeId target, const NodeSet &soids) const
NodeSet	minimalCondSet (const NodeSet &targets, const NodeSet &soids) const
double	log10DomainSize () const
bool	hasSameStructure (const DAGmodel &other)
Constructors and Destructor
	BayesNet ()
	Default constructor. More...
	BayesNet (std::string name)
	Default constructor. More...
	~BayesNet () final
	Destructor. More...
	BayesNet (const BayesNet< GUM_SCALAR > &source)
	Copy constructor. More...
Operators
BayesNet< GUM_SCALAR > &	operator= (const BayesNet< GUM_SCALAR > &source)
	Copy operator. More...
Variable manipulation methods
const Potential< GUM_SCALAR > &	cpt (NodeId varId) const final
	Returns the CPT of a variable. More...
const Potential< GUM_SCALAR > &	cpt (const std::string &name) const
	Returns the CPT of a variable. More...
const VariableNodeMap &	variableNodeMap () const final
	Returns a map between variables and nodes of this gum::BayesNet. More...
NodeId	add (const DiscreteVariable &var)
	Add a variable to the gum::BayesNet. More...
NodeId	add (const std::string &name, unsigned int nbrmod)
	Shortcut for add(gum::LabelizedVariable(name,name,nbrmod)) More...
NodeId	add (const DiscreteVariable &var, MultiDimImplementation< GUM_SCALAR > *aContent)
	Add a variable to the gum::BayesNet. More...
NodeId	add (const DiscreteVariable &var, NodeId id)
	Add a variable to the gum::BayesNet. More...
NodeId	add (const DiscreteVariable &var, MultiDimImplementation< GUM_SCALAR > *aContent, NodeId id)
	Add a variable to the gum::BayesNet. More...
void	erase (NodeId varId)
	Remove a variable from the gum::BayesNet. More...
void	erase (const std::string &name)
	Removes a variable from the gum::BayesNet. More...
void	erase (const DiscreteVariable &var)
	Remove a variable from the gum::BayesNet. More...
const DiscreteVariable &	variable (NodeId id) const final
	Returns a gum::DiscreteVariable given its gum::NodeId in the gum::BayesNet. More...
const DiscreteVariable &	variable (const std::string &name) const
	Returns a gum::DiscreteVariable given its gum::NodeId in the gum::BayesNet. More...
void	changeVariableName (NodeId id, const std::string &new_name)
	Changes a variable's name in the gum::BayesNet. More...
void	changeVariableName (const std::string &name, const std::string &new_name)
	Changes a variable's name. More...
void	changeVariableLabel (NodeId id, const std::string &old_label, const std::string &new_label)
	Changes a variable's label in the gum::BayesNet. More...
void	changeVariableLabel (const std::string &name, const std::string &old_label, const std::string &new_label)
	Changes a variable's name. More...
NodeId	nodeId (const DiscreteVariable &var) const final
	Returns a variable's id in the gum::BayesNet. More...
NodeId	idFromName (const std::string &name) const final
	Returns a variable's id given its name in the gum::BayesNet. More...
const DiscreteVariable &	variableFromName (const std::string &name) const final
	Returns a variable given its name in the gum::BayesNet. More...
Arc manipulation methods.
void	addArc (NodeId tail, NodeId head)
	Add an arc in the BN, and update arc.head's CPT. More...
void	addArc (const std::string &tail, const std::string &head)
	Add an arc in the BN, and update arc.head's CPT. More...
void	eraseArc (const Arc &arc)
	Removes an arc in the BN, and update head's CTP. More...
void	eraseArc (NodeId tail, NodeId head)
	Removes an arc in the BN, and update head's CTP. More...
void	eraseArc (const std::string &tail, const std::string &head)
	Removes an arc in the BN, and update head's CTP. More...
void	beginTopologyTransformation ()
	When inserting/removing arcs, node CPTs change their dimension with a cost in time. More...
void	endTopologyTransformation ()
	terminates a sequence of insertions/deletions of arcs by adjusting all CPTs dimensions. More...
void	reverseArc (NodeId tail, NodeId head)
	Reverses an arc while preserving the same joint distribution. More...
void	reverseArc (const std::string &tail, const std::string &head)
	Reverses an arc while preserving the same joint distribution. More...
void	reverseArc (const Arc &arc)
	Reverses an arc while preserving the same joint distribution. More...
Accessors for nodes with CI or logical implementation
NodeId	addNoisyOR (const DiscreteVariable &var, GUM_SCALAR external_weight)
	Add a variable, it's associate node and a gum::noisyOR implementation. More...
NodeId	addNoisyORNet (const DiscreteVariable &var, GUM_SCALAR external_weight)
	Add a variable, it's associate node and a gum::noisyOR implementation. More...
NodeId	addNoisyORCompound (const DiscreteVariable &var, GUM_SCALAR external_weight)
	Add a variable, it's associate node and a gum::noisyOR implementation. More...
NodeId	addNoisyOR (const DiscreteVariable &var, GUM_SCALAR external_weight, NodeId id)
	Add a variable, its associate node and a noisyOR implementation. More...
NodeId	addNoisyORNet (const DiscreteVariable &var, GUM_SCALAR external_weight, NodeId id)
	Add a variable, its associate node and a noisyOR implementation. More...
NodeId	addNoisyORCompound (const DiscreteVariable &var, GUM_SCALAR external_weight, NodeId id)
	Add a variable, its associate node and a noisyOR implementation. More...
NodeId	addAMPLITUDE (const DiscreteVariable &var)
	Others aggregators. More...
NodeId	addCOUNT (const DiscreteVariable &var, Idx value=1)
	Others aggregators. More...
NodeId	addEXISTS (const DiscreteVariable &var, Idx value=1)
	Others aggregators. More...
NodeId	addFORALL (const DiscreteVariable &var, Idx value=1)
	Others aggregators. More...
NodeId	addMAX (const DiscreteVariable &var)
	Others aggregators. More...
NodeId	addMEDIAN (const DiscreteVariable &var)
	Others aggregators. More...
NodeId	addMIN (const DiscreteVariable &var)
	Others aggregators. More...
Joint Probability manipulation methods
GUM_SCALAR	jointProbability (const Instantiation &i) const
	Compute a parameter of the joint probability for the BN (given an instantiation of the vars) More...
GUM_SCALAR	log2JointProbability (const Instantiation &i) const
	Compute a parameter of the log joint probability for the BN (given an instantiation of the vars) More...
Getter and setters
const std::string &	property (const std::string &name) const
	Return the value of the property name of this DAGModel. More...
const std::string &	propertyWithDefault (const std::string &name, const std::string &byDefault) const
	Return the value of the property name of this DAGModel. More...
void	setProperty (const std::string &name, const std::string &value)
	Add or change a property of this DAGModel. More...
Variable manipulation methods.
const DAG &	dag () const
	Returns a constant reference to the dag of this Bayes Net. More...
Size	size () const
	Returns the number of variables in this Directed Graphical Model. More...
Size	sizeArcs () const
	Returns the number of arcs in this Directed Graphical Model. More...
bool	empty () const
	Retursn true if this Directed Graphical Model is empty. More...
const NodeGraphPart &	nodes () const
	Returns a constant reference to the dag of this Bayes Net. More...
virtual Instantiation	completeInstantiation () const final
	Get an instantiation over all the variables of the model. More...
Arc manipulation methods.
const ArcSet &	arcs () const
	returns the set of nodes with arc ingoing to a given node More...
const NodeSet &	parents (const NodeId id) const
	returns the set of nodes with arc ingoing to a given node More...
const NodeSet &	parents (const std::string &name) const
	returns the set of nodes with arc ingoing to a given node More...
const NodeSet &	children (const NodeId id) const
	returns the set of nodes with arc outgoing from a given node More...
const NodeSet &	children (const std::string &name) const
	returns the set of nodes with arc ingoing to a given node More...
Graphical methods
const UndiGraph &	moralGraph (bool clear=true) const
	The node's id are coherent with the variables and nodes of the topology. More...
const Sequence< NodeId > &	topologicalOrder (bool clear=true) const
	The topological order stays the same as long as no variable or arcs are added or erased src the topology. More...

Static Public Member Functions
static BayesNet< GUM_SCALAR >	fastPrototype (const std::string &dotlike, Size domainSize=2)
	Create a bn with a dotlike syntax : 'a->b->c;b->d;'. More...

Protected Attributes
DAG	_dag
	The DAG of this Directed Graphical Model. More...

Friends
class	BayesNetFactory< GUM_SCALAR >

Detailed Description

template<typename GUM_SCALAR>
class gum::BayesNet< GUM_SCALAR >

Class representing a Bayesian Network.

Bayesian Networks are a probabilistic graphical model in which nodes are random variables and the probability distribution is defined by the product:

\(P(X_1, \ldots, X_2) = \prod_{i=1}^{n} P(X_i | \pi(X_i))\),

where \(\pi(X_i)\) is the parent of \(X_i\).

The probability distribution can be represented as a directed acyclic graph (DAG) where:

• Nodes are discrete random variables.
• An arc A -> B represent a dependency between variables A and B, i.e. B conditional probability distribution is defined as \(P(B| \pi(B)\).

After a variable is added to the BN, if it's domain size changes, then the data in it's CPT is lost.

You should look a the gum::BayesNetFactory class which can help build Bayesian Networks.

You can print a BayesNet using gum::operator<<(std::ostream&, const BayesNet<GUM_SCALAR>&).

Definition at line 78 of file BayesNet.h.

Constructor & Destructor Documentation

BayesNet() [1/3]

template<typename GUM_SCALAR >

INLINE gum::BayesNet< GUM_SCALAR >::BayesNet

(

)

Default constructor.

Definition at line 160 of file BayesNet_tpl.h.

                                          : IBayesNet< GUM_SCALAR >() {
    GUM_CONSTRUCTOR(BayesNet);
  }

BayesNet() [2/3]

template<typename GUM_SCALAR >

INLINE gum::BayesNet< GUM_SCALAR >::BayesNet ( std::string  name )

explicit

Default constructor.

Parameters

name	The BayesNet's name.

Definition at line 165 of file BayesNet_tpl.h.

                                                        :
      IBayesNet< GUM_SCALAR >(name) {
    GUM_CONSTRUCTOR(BayesNet);
  }

~BayesNet()

template<typename GUM_SCALAR >

gum::BayesNet< GUM_SCALAR >::~BayesNet ( )

final

Destructor.

Definition at line 193 of file BayesNet_tpl.h.

                                    {
    GUM_DESTRUCTOR(BayesNet);
    for (const auto p : __probaMap) {
      delete p.second;
    }
  }

BayesNet() [3/3]

template<typename GUM_SCALAR>

gum::BayesNet< GUM_SCALAR >::BayesNet

(

const BayesNet< GUM_SCALAR > &

source

)

Copy constructor.

Definition at line 171 of file BayesNet_tpl.h.

                                                                       :
      IBayesNet< GUM_SCALAR >(source), __varMap(source.__varMap) {
    GUM_CONS_CPY(BayesNet);

    __copyPotentials(source);
  }

Member Function Documentation

__clearPotentials()

template<typename GUM_SCALAR >

void gum::BayesNet< GUM_SCALAR >::__clearPotentials ( )

private

clear all potentials

Definition at line 627 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::generateCPT().

                                                 {
    // Removing previous potentials
    for (const auto& elt : __probaMap) {
      delete elt.second;
    }

    __probaMap.clear();
  }

Here is the caller graph for this function:

__copyPotentials()

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::__copyPotentials ( const BayesNet< GUM_SCALAR > &  source )

private

copy of potentials from a BN to another, using names of vars as ref.

Definition at line 638 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::generateCPT().

                                           {
    // Copying potentials

    for (const auto src : source.__probaMap) {
      // First we build the node's CPT
      Potential< GUM_SCALAR >* copy_array = new Potential< GUM_SCALAR >();
      copy_array->beginMultipleChanges();
      for (gum::Idx i = 0; i < src.second->nbrDim(); i++) {
        (*copy_array) << variableFromName(src.second->variable(i).name());
      }
      copy_array->endMultipleChanges();
      copy_array->copyFrom(*(src.second));

      // We add the CPT to the CPT's hashmap
      __probaMap.insert(src.first, copy_array);
    }
  }

Here is the caller graph for this function:

_unsafeChangePotential()

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::_unsafeChangePotential ( NodeId  id, Potential< GUM_SCALAR > *  newPot  )

private

change the CPT associated to nodeId to newPot delete the old CPT associated to nodeId.

Warning

no verification of dimensions are performer

See also

changePotential

Definition at line 692 of file BayesNet_tpl.h.

                                                 {
    delete __probaMap[id];
    __probaMap[id] = newPot;
  }

add() [1/5]

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::add

(

const DiscreteVariable &

var

)

Add a variable to the gum::BayesNet.

Add a gum::DiscreteVariable, it's associated gum::NodeId and it's gum::Potential.

The variable is added by copy to the gum::BayesNet. The variable's gum::Potential implementation will be a gum::MultiDimArray.

Parameters

var	The variable added by copy.

Returns

Returns the variable's id in the gum::BayesNet.

Exceptions

DuplicateLabel

Raised if variable.name() is already used in this gum::BayesNet.

Definition at line 232 of file BayesNet_tpl.h.

Referenced by gum::credal::CredalNet< GUM_SCALAR >::__bnCopy(), gum::learning::genericBNLearner::Database::__BNVars(), gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization(), gum::build_node(), gum::BayesNet< double >::cpt(), and gum::learning::DAG2BNLearner< ALLOC >::createBN().

                                                                       {
    auto   ptr = new MultiDimArray< GUM_SCALAR >();
    NodeId res = 0;

    try {
      res = add(var, ptr);

    } catch (Exception&) {
      delete ptr;
      throw;
    }

    return res;
  }

Here is the caller graph for this function:

add() [2/5]

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::add	(	const std::string &	name,
		unsigned int	nbrmod
	)

Shortcut for add(gum::LabelizedVariable(name,name,nbrmod))

Add a gum::LabelizedVariable to the gum::BayesNet

This method is just a shortcut for a often used pattern

Exceptions

DuplicateLabel	Raised if variable.name() is already used in this gum::BayesNet.
NotAllowed	if nbrmod<2

Definition at line 248 of file BayesNet_tpl.h.

                                                                       {
    if (nbrmod < 2) {
      GUM_ERROR(OperationNotAllowed,
                "Variable " << name << "needs more than " << nbrmod
                            << " modalities");
    }

    LabelizedVariable v(name, name, nbrmod);
    return add(v);
  }

add() [3/5]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::add	(	const DiscreteVariable &	var,
		MultiDimImplementation< GUM_SCALAR > *	aContent
	)

Add a variable to the gum::BayesNet.

Add a gum::DiscreteVariable, it's associated gum::NodeId and it's gum::Potential.

The variable is added by copy to the gum::BayesNet.

Parameters

var	The variable added by copy.
aContent	The gum::MultiDimImplementation to use for this variable's gum::Potential implementation.

Returns

Returns the variable's id in the gum::BayesNet.

Exceptions

DuplicateLabel

Raised if variable.name() is already used in this gum::BayesNet.

Definition at line 261 of file BayesNet_tpl.h.

                                                                                  {
    NodeId proposedId = dag().nextNodeId();
    NodeId res = 0;

    res = add(var, aContent, proposedId);

    return res;
  }

add() [4/5]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::add	(	const DiscreteVariable &	var,
		NodeId	id
	)

Add a variable to the gum::BayesNet.

Add a gum::DiscreteVariable, it's associated gum::NodeId and it's gum::Potential.

The variable is added by copy to the gum::BayesNet. The variable's gum::Potential implementation will be a gum::MultiDimArray.

Parameters

var	The variable added by copy.
id	The variable's forced gum::NodeId in the gum::BayesNet.

Returns

Returns the variable's id in the gum::BayesNet.

Exceptions

DuplicateElement	Raised id is already used.
DuplicateLabel	Raised if variable.name() is already used in this gum::BayesNet.

Definition at line 272 of file BayesNet_tpl.h.

                                                                        {
    auto   ptr = new MultiDimArray< GUM_SCALAR >();
    NodeId res = 0;

    try {
      res = add(var, ptr, id);

    } catch (Exception&) {
      delete ptr;
      throw;
    }

    return res;
  }

add() [5/5]

template<typename GUM_SCALAR>

NodeId gum::BayesNet< GUM_SCALAR >::add	(	const DiscreteVariable &	var,
		MultiDimImplementation< GUM_SCALAR > *	aContent,
		NodeId	id
	)

Add a variable to the gum::BayesNet.

Add a gum::DiscreteVariable, it's associated gum::NodeId and it's gum::Potential.

Parameters

var	The variable added by copy.
aContent	The gum::MultiDimImplementation to use for this variable's gum::Potential implementation.
id	The variable's forced gum::NodeId in the gum::BayesNet.

Returns

Returns the variable's id in the gum::BayesNet.

Exceptions

DuplicateElement	Raised id is already used.
DuplicateLabel	Raised if variable.name() is already used in this gum::BayesNet.

Definition at line 290 of file BayesNet_tpl.h.

                                                                           {
    __varMap.insert(id, var);
    this->_dag.addNodeWithId(id);

    auto cpt = new Potential< GUM_SCALAR >(aContent);
    (*cpt) << variable(id);
    __probaMap.insert(id, cpt);
    return id;
  }

addAMPLITUDE()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addAMPLITUDE

(

const DiscreteVariable &

var

)

Others aggregators.

Definition at line 461 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                                {
    return add(var, new aggregator::Amplitude< GUM_SCALAR >());
  }

Here is the caller graph for this function:

addAND()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addAND

(

const DiscreteVariable &

var

)

Add a variable, it's associate node and an AND implementation.

The id of the new variable is automatically generated.

Warning

AND is implemented as a gum::aggregator::And which means that if parents are not boolean, all value>1 is True

Parameters

var	The variable added by copy.

Returns

the id of the added variable.

Exceptions

SizeError

if variable.domainSize()>2

Definition at line 466 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                          {
    if (var.domainSize() > 2) GUM_ERROR(SizeError, "an AND has to be boolean");

    return add(var, new aggregator::And< GUM_SCALAR >());
  }

Here is the caller graph for this function:

addArc() [1/2]

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::addArc	(	NodeId	tail,
		NodeId	head
	)

Add an arc in the BN, and update arc.head's CPT.

Parameters

head	and
tail	as NodeId

Exceptions

InvalidEdge	If arc.tail and/or arc.head are not in the BN.
DuplicateElement	if the arc already exists

Definition at line 348 of file BayesNet_tpl.h.

Referenced by gum::credal::CredalNet< GUM_SCALAR >::__bnCopy(), gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization(), gum::BayesNet< double >::changeVariableLabel(), gum::learning::DAG2BNLearner< ALLOC >::createBN(), and gum::BayesNet< double >::fastPrototype().

                                                                     {
    if (this->_dag.existsArc(tail, head)) {
      GUM_ERROR(DuplicateElement,
                "The arc (" << tail << "," << head << ") already exists.")
    }

    this->_dag.addArc(tail, head);
    // Add parent in the child's CPT
    (*(__probaMap[head])) << variable(tail);
  }

Here is the caller graph for this function:

addArc() [2/2]

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::addArc	(	const std::string &	tail,
		const std::string &	head
	)

Add an arc in the BN, and update arc.head's CPT.

Exceptions

gum::DuplicateElement

if the arc already exists

Definition at line 360 of file BayesNet_tpl.h.

                                                                    {
    try {
      addArc(this->idFromName(tail), this->idFromName(head));
    } catch (DuplicateElement) {
      GUM_ERROR(DuplicateElement,
                "The arc " << tail << "->" << head << " already exists.")
    }
  }

addCOUNT()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addCOUNT	(	const DiscreteVariable &	var,
		Idx	value = 1
	)

Others aggregators.

Definition at line 473 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                                {
    return add(var, new aggregator::Count< GUM_SCALAR >(value));
  }

Here is the caller graph for this function:

addEXISTS()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addEXISTS	(	const DiscreteVariable &	var,
		Idx	value = 1
	)

Others aggregators.

Definition at line 479 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                                 {
    if (var.domainSize() > 2) GUM_ERROR(SizeError, "an EXISTS has to be boolean");

    return add(var, new aggregator::Exists< GUM_SCALAR >(value));
  }

Here is the caller graph for this function:

addFORALL()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addFORALL	(	const DiscreteVariable &	var,
		Idx	value = 1
	)

Others aggregators.

Definition at line 487 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                                 {
    if (var.domainSize() > 2) GUM_ERROR(SizeError, "an EXISTS has to be boolean");

    return add(var, new aggregator::Forall< GUM_SCALAR >(value));
  }

Here is the caller graph for this function:

addLogit() [1/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addLogit	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight,
		NodeId	id
	)

Add a variable, its associate node and a Logit implementation.

Parameters

var	The variable added by copy
external_weight	see gum::MultiDimLogit
id	proposed gum::nodeId for the variable

Warning

give an id should be reserved for rare and specific situations !!!

Returns

the id of the added variable.

Definition at line 565 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                {
    return add(var, new MultiDimLogit< GUM_SCALAR >(external_weight), id);
  }

Here is the caller graph for this function:

addLogit() [2/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addLogit	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight
	)

Add a variable, its associate node and a Logit implementation.

The id of the new variable is automatically generated.

Parameters

var	The variable added by copy.
external_weight	see gum::MultiDimLogit

Returns

the id of the added variable.

Definition at line 545 of file BayesNet_tpl.h.

                                                                             {
    return add(var, new MultiDimLogit< GUM_SCALAR >(external_weight));
  }

addMAX()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addMAX

(

const DiscreteVariable &

var

)

Others aggregators.

Definition at line 495 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                          {
    return add(var, new aggregator::Max< GUM_SCALAR >());
  }

Here is the caller graph for this function:

addMEDIAN()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addMEDIAN

(

const DiscreteVariable &

var

)

Others aggregators.

Definition at line 500 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                             {
    return add(var, new aggregator::Median< GUM_SCALAR >());
  }

Here is the caller graph for this function:

addMIN()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addMIN

(

const DiscreteVariable &

var

)

Others aggregators.

Definition at line 505 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                          {
    return add(var, new aggregator::Min< GUM_SCALAR >());
  }

Here is the caller graph for this function:

addNoisyAND() [1/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addNoisyAND	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight,
		NodeId	id
	)

Add a variable, its associate node and a noisyAND implementation.

Parameters

var	The variable added by copy
external_weight	see gum::MultiDimNoisyAND
id	proposed gum::nodeId for the variable

Warning

give an id should be reserved for rare and specific situations !!!

Returns

the id of the added variable.

Definition at line 558 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                   {
    return add(var, new MultiDimNoisyAND< GUM_SCALAR >(external_weight), id);
  }

Here is the caller graph for this function:

addNoisyAND() [2/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addNoisyAND	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight
	)

Add a variable, its associate node and a noisyAND implementation.

The id of the new variable is automatically generated.

Parameters

var	The variable added by copy.
external_weight	see gum::MultiDimNoisyAND

Returns

the id of the added variable.

Definition at line 539 of file BayesNet_tpl.h.

                                                                                {
    return add(var, new MultiDimNoisyAND< GUM_SCALAR >(external_weight));
  }

addNoisyOR() [1/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addNoisyOR	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight
	)

Add a variable, it's associate node and a gum::noisyOR implementation.

The id of the new variable is automatically generated. Since it seems that the 'classical' noisyOR is the Compound noisyOR, we keep the gum::BayesNet::addNoisyOR as an alias for gum::BayesNet::addNoisyORCompound

Parameters

var	The variable added by copy.
external_weight	see ref gum::MultiDimNoisyORNet,gum::MultiDimNoisyORCompound

Returns

the id of the added variable.

Definition at line 521 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                               {
    return addNoisyORCompound(var, external_weight);
  }

Here is the caller graph for this function:

addNoisyOR() [2/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addNoisyOR	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight,
		NodeId	id
	)

Add a variable, its associate node and a noisyOR implementation.

Since it seems that the 'classical' noisyOR is the Compound noisyOR, we keep the addNoisyOR as an alias for addNoisyORCompound.

Parameters

var	The variable added by copy.
external_weight	see gum::MultiDimNoisyORNet, gum::MultiDimNoisyORCompound
id	The chosen id

Warning

give an id should be reserved for rare and specific situations !!!

Returns

the id of the added variable.

Exceptions

DuplicateElement

if id is already used

Definition at line 551 of file BayesNet_tpl.h.

                                                                  {
    return addNoisyORCompound(var, external_weight, id);
  }

addNoisyORCompound() [1/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addNoisyORCompound	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight
	)

Add a variable, it's associate node and a gum::noisyOR implementation.

The id of the new variable is automatically generated. Since it seems that the 'classical' noisyOR is the Compound noisyOR, we keep the gum::BayesNet::addNoisyOR as an alias for gum::BayesNet::addNoisyORCompound

Parameters

var	The variable added by copy.
external_weight	see ref gum::MultiDimNoisyORNet,gum::MultiDimNoisyORCompound

Returns

the id of the added variable.

Definition at line 527 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                              {
    return add(var, new MultiDimNoisyORCompound< GUM_SCALAR >(external_weight));
  }

Here is the caller graph for this function:

addNoisyORCompound() [2/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addNoisyORCompound	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight,
		NodeId	id
	)

Add a variable, its associate node and a noisyOR implementation.

Since it seems that the 'classical' noisyOR is the Compound noisyOR, we keep the addNoisyOR as an alias for addNoisyORCompound.

Parameters

var	The variable added by copy.
external_weight	see gum::MultiDimNoisyORNet, gum::MultiDimNoisyORCompound
id	The chosen id

Warning

give an id should be reserved for rare and specific situations !!!

Returns

the id of the added variable.

Exceptions

DuplicateElement

if id is already used

Definition at line 572 of file BayesNet_tpl.h.

                                                                         {
    return add(
       var, new MultiDimNoisyORCompound< GUM_SCALAR >(external_weight), id);
  }

addNoisyORNet() [1/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addNoisyORNet	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight
	)

Add a variable, it's associate node and a gum::noisyOR implementation.

The id of the new variable is automatically generated. Since it seems that the 'classical' noisyOR is the Compound noisyOR, we keep the gum::BayesNet::addNoisyOR as an alias for gum::BayesNet::addNoisyORCompound

Parameters

var	The variable added by copy.
external_weight	see ref gum::MultiDimNoisyORNet,gum::MultiDimNoisyORCompound

Returns

the id of the added variable.

Definition at line 533 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                                  {
    return add(var, new MultiDimNoisyORNet< GUM_SCALAR >(external_weight));
  }

Here is the caller graph for this function:

addNoisyORNet() [2/2]

template<typename GUM_SCALAR>

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addNoisyORNet	(	const DiscreteVariable &	var,
		GUM_SCALAR	external_weight,
		NodeId	id
	)

Add a variable, its associate node and a noisyOR implementation.

Since it seems that the 'classical' noisyOR is the Compound noisyOR, we keep the addNoisyOR as an alias for addNoisyORCompound.

Parameters

var	The variable added by copy.
external_weight	see gum::MultiDimNoisyORNet, gum::MultiDimNoisyORCompound
id	The chosen id

Warning

give an id should be reserved for rare and specific situations !!!

Returns

the id of the added variable.

Exceptions

DuplicateElement

if id is already used

Definition at line 579 of file BayesNet_tpl.h.

                                                                     {
    return add(var, new MultiDimNoisyORNet< GUM_SCALAR >(external_weight), id);
  }

addOR()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::addOR

(

const DiscreteVariable &

var

)

Add a variable, it's associate node and an OR implementation.

The id of the new variable is automatically generated.

Warning

OR is implemented as a gum::aggregator::Or which means that if parents are not boolean, all value>1 is True

Parameters

var	The variable added by copy.

Returns

the id of the added variable.

Exceptions

SizeError

if variable.domainSize()>2

Definition at line 510 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::reverseArc().

                                                                         {
    if (var.domainSize() > 2) GUM_ERROR(SizeError, "an OR has to be boolean");

    return add(var, new aggregator::Or< GUM_SCALAR >());
  }

Here is the caller graph for this function:

addWeightedArc() [1/2]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::addWeightedArc	(	NodeId	tail,
		NodeId	head,
		GUM_SCALAR	causalWeight
	)

Add an arc in the BN, and update arc.head's CPT.

Parameters

head	and
tail	as NodeId
causalWeight	see gum::MultiDimICIModel

Exceptions

InvalidArc	If arc.tail and/or arc.head are not in the BN.
InvalidArc	If variable in arc.head is not a NoisyOR variable.

Definition at line 586 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::addWeightedArc(), and gum::BayesNet< double >::reverseArc().

                                                                       {
    auto* CImodel =
       dynamic_cast< const MultiDimICIModel< GUM_SCALAR >* >(cpt(head).content());

    if (CImodel != 0) {
      // or is OK
      addArc(tail, head);

      CImodel->causalWeight(variable(tail), causalWeight);
    } else {
      GUM_ERROR(InvalidArc,
                "Head variable (" << variable(head).name()
                                  << ") is not a CIModel variable !");
    }
  }

Here is the caller graph for this function:

addWeightedArc() [2/2]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::addWeightedArc ( const std::string &  tail, const std::string &  head, GUM_SCALAR  causalWeight  )

inline

Add an arc in the BN, and update arc.head's CPT.

Parameters

head	and
tail	as std::string
causalWeight	see gum::MultiDimICIModel
NotFound	if no node with sun names is found

Exceptions

InvalidArc	If arc.tail and/or arc.head are not in the BN.
InvalidArc	If variable in arc.head is not a NoisyOR variable.

Definition at line 620 of file BayesNet.h.

                                                         {
      addWeightedArc(idFromName(tail), idFromName(head), causalWeight);
    };

arcs()

INLINE const ArcSet & gum::DAGmodel::arcs ( ) const

inherited

returns the set of nodes with arc ingoing to a given node

Note that the set of arcs returned may be empty if no arc within the ArcGraphPart is ingoing into the given node.

Parameters

id	the node toward which the arcs returned are pointing

Definition at line 104 of file DAGmodel_inl.h.

References gum::DAGmodel::_dag, and gum::ArcGraphPart::arcs().

Referenced by gum::EssentialGraph::__buildEssentialGraph(), gum::DAGmodel::__moralGraph(), gum::MarkovBlanket::hasSameStructure(), and gum::DAGmodel::hasSameStructure().

{ return _dag.arcs(); }

Here is the call graph for this function:

Here is the caller graph for this function:

beginTopologyTransformation()

template<typename GUM_SCALAR >

void gum::BayesNet< GUM_SCALAR >::beginTopologyTransformation

(

)

When inserting/removing arcs, node CPTs change their dimension with a cost in time.

begin Multiple Change for all CPTs

These functions delay the CPTs change to be done just once at the end of a sequence of topology modification. begins a sequence of insertions/deletions of arcs without changing the dimensions of the CPTs.

Definition at line 613 of file BayesNet_tpl.h.

Referenced by gum::credal::CredalNet< GUM_SCALAR >::__bnCopy(), gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization(), gum::learning::DAG2BNLearner< ALLOC >::createBN(), and gum::BayesNet< double >::eraseArc().

                                                           {
    for (const auto node : nodes())
      __probaMap[node]->beginMultipleChanges();
  }

Here is the caller graph for this function:

changePotential() [1/2]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::changePotential	(	NodeId	id,
		Potential< GUM_SCALAR > *	newPot
	)

change the CPT associated to nodeId to newPot delete the old CPT associated to nodeId.

Exceptions

NotAllowed

if newPot has not the same signature as __probaMap[NodeId]

Definition at line 671 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::generateCPT().

                                                                                {
    if (cpt(id).nbrDim() != newPot->nbrDim()) {
      GUM_ERROR(OperationNotAllowed,
                "cannot exchange potentials with different "
                "dimensions for variable with id "
                   << id);
    }

    for (Idx i = 0; i < cpt(id).nbrDim(); i++) {
      if (&cpt(id).variable(i) != &(newPot->variable(i))) {
        GUM_ERROR(OperationNotAllowed,
                  "cannot exchange potentials because, for variable with id "
                     << id << ", dimension " << i << " differs. ");
      }
    }

    _unsafeChangePotential(id, newPot);
  }

Here is the caller graph for this function:

changePotential() [2/2]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::changePotential	(	const std::string &	name,
		Potential< GUM_SCALAR > *	newPot
	)

Definition at line 699 of file BayesNet_tpl.h.

                                                                                {
    changePotential(idFromName(name), newPot);
  }

changeVariableLabel() [1/2]

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::changeVariableLabel	(	NodeId	id,
		const std::string &	old_label,
		const std::string &	new_label
	)

Changes a variable's label in the gum::BayesNet.

This will change the gum::LabelizedVariable names in the gum::BayesNet.

Exceptions

DuplicateLabel	Raised if new_label is already used in this gum::LabelizedVariable.
NotFound	Raised if no variable matches id or if the variable is not a LabelizedVariable

Definition at line 214 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::changeVariableLabel(), and gum::BayesNet< double >::changeVariableName().

                                                                        {
    if (variable(id).varType() != VarType::Labelized) {
      GUM_ERROR(NotFound, "Variable " << id << " is not a LabelizedVariable.");
    }
    LabelizedVariable* var = dynamic_cast< LabelizedVariable* >(
       const_cast< DiscreteVariable* >(&variable(id)));

    var->changeLabel(var->posLabel(old_label), new_label);
  }

Here is the caller graph for this function:

changeVariableLabel() [2/2]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::changeVariableLabel ( const std::string &  name, const std::string &  old_label, const std::string &  new_label  )

inline

Changes a variable's name.

Definition at line 336 of file BayesNet.h.

                                                         {
      changeVariableLabel(idFromName(name), old_label, new_label);
    }

changeVariableName() [1/2]

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::changeVariableName	(	NodeId	id,
		const std::string &	new_name
	)

Changes a variable's name in the gum::BayesNet.

This will change the gum::DiscreteVariable names in the gum::BayesNet.

Exceptions

DuplicateLabel	Raised if newName is already used in this gum::BayesNet.
NotFound	Raised if no variable matches id.

Definition at line 208 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::changeVariableName(), and gum::BayesNet< double >::variable().

                                                                           {
    __varMap.changeName(id, new_name);
  }

Here is the caller graph for this function:

changeVariableName() [2/2]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::changeVariableName ( const std::string &  name, const std::string &  new_name  )

inline

Changes a variable's name.

Definition at line 315 of file BayesNet.h.

                                                                              {
      changeVariableName(idFromName(name), new_name);
    }

children() [1/2]

INLINE const NodeSet & gum::DAGmodel::children ( const NodeId  id ) const

inherited

returns the set of nodes with arc outgoing from a given node

Note that the set of arcs returned may be empty if no arc within the ArcGraphPart is outgoing from the given node.

Parameters

id	the node which is the tail of the arcs returned

Definition at line 111 of file DAGmodel_inl.h.

References gum::DAGmodel::_dag, and gum::ArcGraphPart::children().

Referenced by gum::MarkovBlanket::__buildMarkovBlanket(), gum::DAGmodel::parents(), gum::prm::InstanceBayesNet< GUM_SCALAR >::toDot(), and gum::prm::ClassBayesNet< GUM_SCALAR >::toDot().

                                                                {
    return _dag.children(id);
  }

Here is the call graph for this function:

Here is the caller graph for this function:

children() [2/2]

const NodeSet& gum::DAGmodel::children ( const std::string &  name ) const

inlineinherited

returns the set of nodes with arc ingoing to a given node

Note that the set of arcs returned may be empty if no arc within the ArcGraphPart is ingoing into the given node.

Parameters

id	the node toward which the arcs returned are pointing

Definition at line 165 of file DAGmodel.h.

References gum::DAGmodel::hasSameStructure(), gum::DAGmodel::idFromName(), gum::DAGmodel::log10DomainSize(), gum::DAGmodel::moralGraph(), gum::DAGmodel::operator=(), gum::DAGmodel::parents(), and gum::DAGmodel::topologicalOrder().

                                                         {
      return parents(idFromName(name));
    };

Here is the call graph for this function:

completeInstantiation()

INLINE Instantiation gum::DAGmodel::completeInstantiation ( ) const

finalvirtualinherited

Get an instantiation over all the variables of the model.

Definition at line 86 of file DAGmodel_inl.h.

References gum::DAGmodel::dag(), and gum::DAGmodel::variable().

                                                      {
    Instantiation I;

    for (const auto node : dag())
      I << variable(node);

    return I;
  }

Here is the call graph for this function:

cpt() [1/2]

template<typename GUM_SCALAR >

INLINE const Potential< GUM_SCALAR > & gum::BayesNet< GUM_SCALAR >::cpt ( NodeId  varId ) const

finalvirtual

Returns the CPT of a variable.

Parameters

varId

A variable's id in the gum::BayesNet.

Returns

The variable's CPT.

Exceptions

NotFound

If no variable's id matches varId.

Implements gum::IBayesNet< GUM_SCALAR >.

Definition at line 315 of file BayesNet_tpl.h.

Referenced by gum::credal::CredalNet< GUM_SCALAR >::__bnCopy(), gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization(), gum::BayesNet< double >::cpt(), gum::learning::DAG2BNLearner< ALLOC >::createBN(), gum::SimpleCPTDisturber< GUM_SCALAR >::disturbAugmCPT(), gum::SimpleCPTDisturber< GUM_SCALAR >::disturbReducCPT(), and gum::credal::CredalNet< GUM_SCALAR >::toString().

                                                             {
    return *(__probaMap[varId]);
  }

Here is the caller graph for this function:

cpt() [2/2]

template<typename GUM_SCALAR>

const Potential< GUM_SCALAR >& gum::BayesNet< GUM_SCALAR >::cpt ( const std::string &  name ) const

inline

Returns the CPT of a variable.

Definition at line 155 of file BayesNet.h.

                                                                    {
      return cpt(idFromName(name));
    };

dag()

INLINE const DAG & gum::DAGmodel::dag ( ) const

inherited

Returns a constant reference to the dag of this Bayes Net.

Definition at line 63 of file DAGmodel_inl.h.

References gum::DAGmodel::_dag.

Referenced by gum::DAGmodel::__moralGraph(), gum::DAGmodel::completeInstantiation(), gum::learning::DAG2BNLearner< ALLOC >::createBN(), gum::learning::genericBNLearner::Database::Database(), gum::BayesNetFragment< GUM_SCALAR >::installCPT(), gum::BayesNetFragment< GUM_SCALAR >::isInstalledNode(), gum::MarginalTargetedInference< GUM_SCALAR >::MarginalTargetedInference(), gum::BayesBall::relevantPotentials(), gum::dSeparation::relevantPotentials(), gum::DAGmodel::size(), gum::BayesNetFragment< GUM_SCALAR >::toDot(), gum::DAGmodel::topologicalOrder(), gum::InfluenceDiagram< GUM_SCALAR >::toString(), and gum::BayesNetFragment< GUM_SCALAR >::whenArcDeleted().

{ return _dag; }

Here is the caller graph for this function:

dim()

template<typename GUM_SCALAR >

Size gum::IBayesNet< GUM_SCALAR >::dim ( ) const

inherited

Returns the dimension (the number of free parameters) in this bayes net.

\( dim(G)=\sum_{i \in nodes} ((r_i-1)\cdot q_i) \) where \( r_i \) is the number of instantiations of node \( i \) and \( q_i \) is the number of instantiations of its parents.

Definition at line 79 of file IBayesNet_tpl.h.

                                          {
    Size dim = 0;

    for (auto node : nodes()) {
      Size q = 1;

      for (auto parent : parents(node))
        q *= variable(parent).domainSize();

      dim += (variable(node).domainSize() - 1) * q;
    }

    return dim;
  }

empty()

INLINE bool gum::DAGmodel::empty ( ) const

inherited

Retursn true if this Directed Graphical Model is empty.

Definition at line 99 of file DAGmodel_inl.h.

References gum::DAGmodel::size().

{ return size() == 0; }

Here is the call graph for this function:

endTopologyTransformation()

template<typename GUM_SCALAR >

void gum::BayesNet< GUM_SCALAR >::endTopologyTransformation

(

)

terminates a sequence of insertions/deletions of arcs by adjusting all CPTs dimensions.

end Multiple Change for all CPTs

Definition at line 620 of file BayesNet_tpl.h.

Referenced by gum::credal::CredalNet< GUM_SCALAR >::__bnCopy(), gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization(), gum::learning::DAG2BNLearner< ALLOC >::createBN(), and gum::BayesNet< double >::eraseArc().

                                                         {
    for (const auto node : nodes())
      __probaMap[node]->endMultipleChanges();
  }

Here is the caller graph for this function:

erase() [1/3]

template<typename GUM_SCALAR >

void gum::BayesNet< GUM_SCALAR >::erase

(

NodeId

varId

)

Remove a variable from the gum::BayesNet.

Removes the corresponding variable from the gum::BayesNet and from all of it's children gum::Potential.

If no variable matches the given id, then nothing is done.

Parameters

varId

The variable's id to remove.

Definition at line 330 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::cpt(), and gum::BayesNet< double >::erase().

                                                 {
    if (__varMap.exists(varId)) {
      // Reduce the variable child's CPT
      const NodeSet& children = this->children(varId);

      for (const auto c : children) {
        __probaMap[c]->erase(variable(varId));
      }

      delete __probaMap[varId];

      __probaMap.erase(varId);
      __varMap.erase(varId);
      this->_dag.eraseNode(varId);
    }
  }

Here is the caller graph for this function:

erase() [2/3]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::erase ( const std::string &  name )

inline

Removes a variable from the gum::BayesNet.

Definition at line 267 of file BayesNet.h.

Referenced by gum::BayesNet< double >::erase().

{ erase(idFromName(name)); };

Here is the caller graph for this function:

erase() [3/3]

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::erase

(

const DiscreteVariable &

var

)

Remove a variable from the gum::BayesNet.

Removes the corresponding variable from the gum::BayesNet and from all of it's children gum::Potential.

If no variable matches the given variable, then nothing is done.

Parameters

var	A reference on the variable to remove.

Definition at line 325 of file BayesNet_tpl.h.

                                                                       {
    erase(__varMap.get(var));
  }

eraseArc() [1/3]

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::eraseArc

(

const Arc &

arc

)

Removes an arc in the BN, and update head's CTP.

If (tail, head) doesn't exist, the nothing happens.

Parameters

arc	The arc removed.

Definition at line 371 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::changeVariableLabel(), and gum::BayesNet< double >::eraseArc().

                                                             {
    if (__varMap.exists(arc.tail()) && __varMap.exists(arc.head())) {
      NodeId head = arc.head(), tail = arc.tail();
      this->_dag.eraseArc(arc);
      // Remove parent froms child's CPT
      (*(__probaMap[head])) >> variable(tail);
    }
  }

Here is the caller graph for this function:

eraseArc() [2/3]

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::eraseArc	(	NodeId	tail,
		NodeId	head
	)

Removes an arc in the BN, and update head's CTP.

If (tail, head) doesn't exist, the nothing happens.

Parameters

head	and
tail	as NodeId

Definition at line 381 of file BayesNet_tpl.h.

                                                                       {
    eraseArc(Arc(tail, head));
  }

eraseArc() [3/3]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::eraseArc ( const std::string &  tail, const std::string &  head  )

inline

Removes an arc in the BN, and update head's CTP.

Definition at line 416 of file BayesNet.h.

                                                                {
      eraseArc(idFromName(tail), idFromName(head));
    }

fastPrototype()

template<typename GUM_SCALAR >

BayesNet< GUM_SCALAR > gum::BayesNet< GUM_SCALAR >::fastPrototype ( const std::string &  dotlike, Size  domainSize = 2  )

static

Create a bn with a dotlike syntax : 'a->b->c;b->d;'.

The domain size maybe specified using 'a[10]' or using 'a{yes|maybe|no}'. Note that if the dotlike string contains such a specification for an already defined variable, the first specification will be used.

Parameters

dotlike	the string containing the specification
domainSize	the default domain size for variables

Returns

the resulting bayesian network

Definition at line 127 of file BayesNet_tpl.h.

                                                                          {
    gum::BayesNet< GUM_SCALAR > bn;


    for (const auto& chaine : split(dotlike, ";")) {
      NodeId lastId = 0;
      bool   notfirst = false;
      for (const auto& souschaine : split(chaine, "->")) {
        bool forward = true;
        for (const auto& node : split(souschaine, "<-")) {
          auto idVar = build_node(bn, node, domainSize);
          if (notfirst) {
            if (forward) {
              bn.addArc(lastId, idVar);
              forward = false;
            } else {
              bn.addArc(idVar, lastId);
            }
          } else {
            notfirst = true;
            forward = false;
          }
          lastId = idVar;
        }
      }
    }
    bn.generateCPTs();
    bn.setProperty("name", dotlike);
    return bn;
  }

generateCPT() [1/2]

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::generateCPT

(

NodeId

node

)

const

randomly generate CPT for a given node in a given structure

Definition at line 664 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::addWeightedArc(), and gum::BayesNet< double >::generateCPT().

                                                                   {
    SimpleCPTGenerator< GUM_SCALAR > generator;

    generator.generateCPT(cpt(node).pos(variable(node)), cpt(node));
  }

Here is the caller graph for this function:

generateCPT() [2/2]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::generateCPT ( const std::string &  name ) const

inline

Definition at line 632 of file BayesNet.h.

                                                  {
      generateCPT(idFromName(name));
    };

generateCPTs()

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::generateCPTs

(

)

const

randomly generates CPTs for a given structure

Definition at line 658 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::addWeightedArc(), and gum::BayesNet< double >::fastPrototype().

                                                         {
    for (const auto node : nodes())
      generateCPT(node);
  }

Here is the caller graph for this function:

hasSameStructure()

bool gum::DAGmodel::hasSameStructure ( const DAGmodel &  other )

inherited

Returns

true if all the named node are the same and all the named arcs are the same

Definition at line 121 of file DAGmodel.cpp.

References gum::DAGmodel::arcs(), gum::Set< Key, Alloc >::exists(), gum::DAGmodel::idFromName(), gum::DAGmodel::nodes(), gum::DAGmodel::size(), gum::DAGmodel::sizeArcs(), and gum::DAGmodel::variable().

Referenced by gum::DAGmodel::children().

                                                       {
    if (this == &other) return true;

    if (size() != other.size()) return false;

    if (sizeArcs() != other.sizeArcs()) return false;

    for (const auto& nid : nodes()) {
      try {
        other.idFromName(variable(nid).name());
      } catch (NotFound) { return false; }
    }

    for (const auto& arc : arcs()) {
      if (!other.arcs().exists(Arc(other.idFromName(variable(arc.tail()).name()),
                                   other.idFromName(variable(arc.head()).name()))))
        return false;
    }

    return true;
  }

Here is the call graph for this function:

Here is the caller graph for this function:

idFromName()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::idFromName ( const std::string &  name ) const

finalvirtual

Returns a variable's id given its name in the gum::BayesNet.

Parameters

name	The variable's name from which the gum::NodeId is returned.

Returns

Returns the variable gum::NodeId in the gum::BayesNet.

Exceptions

NotFound

Raised if name does not match a variable in the gum::BayesNet.

Implements gum::IBayesNet< GUM_SCALAR >.

Definition at line 303 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::addWeightedArc(), gum::build_node(), gum::BayesNet< double >::changeVariableLabel(), gum::BayesNet< double >::changeVariableName(), gum::BayesNet< double >::cpt(), gum::BayesNet< double >::erase(), gum::BayesNet< double >::eraseArc(), gum::BayesNet< double >::generateCPT(), gum::BayesNet< double >::idFromName(), gum::BayesNet< double >::reverseArc(), and gum::BayesNet< double >::variable().

                                                                              {
    return __varMap.idFromName(name);
  }

Here is the caller graph for this function:

jointProbability()

template<typename GUM_SCALAR >

GUM_SCALAR gum::IBayesNet< GUM_SCALAR >::jointProbability ( const Instantiation &  i ) const

inherited

Compute a parameter of the joint probability for the BN (given an instantiation of the vars)

Warning

a variable not present in the instantiation is assumed to be instantiated to 0.

Definition at line 220 of file IBayesNet_tpl.h.

                                                                           {
    auto value = (GUM_SCALAR)1.0;

    GUM_SCALAR tmp;

    for (auto node : nodes()) {
      if ((tmp = cpt(node)[i]) == (GUM_SCALAR)0) { return (GUM_SCALAR)0; }

      value *= tmp;
    }

    return value;
  }

log10DomainSize()

INLINE double gum::DAGmodel::log10DomainSize ( ) const

inherited

Returns

Returns the log10 domain size of the joint probabilty for the Directed Graphical Model

Definition at line 75 of file DAGmodel_inl.h.

References gum::DAGmodel::nodes(), and gum::DAGmodel::variable().

Referenced by gum::DAGmodel::children(), and gum::InfluenceDiagram< GUM_SCALAR >::toString().

                                         {
    double dSize = 0.0;

    for (const auto node : nodes()) {
      dSize += std::log10(variable(node).domainSize());
    }

    return dSize;
  }

Here is the call graph for this function:

Here is the caller graph for this function:

log2JointProbability()

template<typename GUM_SCALAR >

GUM_SCALAR gum::IBayesNet< GUM_SCALAR >::log2JointProbability ( const Instantiation &  i ) const

inherited

Compute a parameter of the log joint probability for the BN (given an instantiation of the vars)

Compute a parameter of the joint probability for the BN (given an instantiation of the vars)

Warning

a variable not present in the instantiation is assumed to be instantiated to 0.

Definition at line 239 of file IBayesNet_tpl.h.

                                                                               {
    auto value = (GUM_SCALAR)0.0;

    GUM_SCALAR tmp;

    for (auto node : nodes()) {
      if ((tmp = cpt(node)[i]) == (GUM_SCALAR)0) {
        return (GUM_SCALAR)(-std::numeric_limits< double >::infinity());
      }

      value += log2(cpt(node)[i]);
    }

    return value;
  }

maxNonOneParam()

template<typename GUM_SCALAR >

GUM_SCALAR gum::IBayesNet< GUM_SCALAR >::maxNonOneParam ( ) const

inherited

Returns

the biggest value (not equal to 1) in the CPTs of *this

Definition at line 135 of file IBayesNet_tpl.h.

                                                           {
    GUM_SCALAR res = 0.0;
    for (auto node : nodes()) {
      auto v = cpt(node).maxNonOne();
      if (v > res) { res = v; }
    }
    return res;
  }

maxParam()

template<typename GUM_SCALAR >

GUM_SCALAR gum::IBayesNet< GUM_SCALAR >::maxParam ( ) const

inherited

Returns

the biggest value in the CPTs of *this

Definition at line 115 of file IBayesNet_tpl.h.

                                                     {
    GUM_SCALAR res = 1.0;
    for (auto node : nodes()) {
      auto v = cpt(node).max();
      if (v > res) { res = v; }
    }
    return res;
  }

maxVarDomainSize()

template<typename GUM_SCALAR >

Size gum::IBayesNet< GUM_SCALAR >::maxVarDomainSize ( ) const

inherited

Returns

the biggest domainSize among the variables of *this

Definition at line 95 of file IBayesNet_tpl.h.

Referenced by gum::ImportanceSampling< GUM_SCALAR >::_onContextualize().

                                                       {
    Size res = 0;
    for (auto node : nodes()) {
      auto v = variable(node).domainSize();
      if (v > res) { res = v; }
    }
    return res;
  }

Here is the caller graph for this function:

minimalCondSet() [1/2]

template<typename GUM_SCALAR >

NodeSet gum::IBayesNet< GUM_SCALAR >::minimalCondSet ( NodeId  target, const NodeSet &  soids  ) const

inherited

Definition at line 355 of file IBayesNet_tpl.h.

                                                                              {
    if (soids.contains(target)) return NodeSet({target});

    NodeSet res;
    NodeSet alreadyVisitedUp;
    NodeSet alreadyVisitedDn;
    alreadyVisitedDn << target;
    alreadyVisitedUp << target;

    for (auto fath : _dag.parents(target))
      __minimalCondSetVisitUp(
         fath, soids, res, alreadyVisitedUp, alreadyVisitedDn);
    for (auto chil : _dag.children(target))
      __minimalCondSetVisitDn(
         chil, soids, res, alreadyVisitedUp, alreadyVisitedDn);
    return res;
  }

minimalCondSet() [2/2]

template<typename GUM_SCALAR >

NodeSet gum::IBayesNet< GUM_SCALAR >::minimalCondSet ( const NodeSet &  targets, const NodeSet &  soids  ) const

inherited

Definition at line 375 of file IBayesNet_tpl.h.

                                                                              {
    NodeSet res;
    for (auto node : targets) {
      res += minimalCondSet(node, soids);
    }
    return res;
  }

minNonZeroParam()

template<typename GUM_SCALAR >

GUM_SCALAR gum::IBayesNet< GUM_SCALAR >::minNonZeroParam ( ) const

inherited

Returns

the smallest value (not equal to 0) in the CPTs of *this

Definition at line 125 of file IBayesNet_tpl.h.

Referenced by gum::ImportanceSampling< GUM_SCALAR >::_onContextualize().

                                                            {
    GUM_SCALAR res = 1.0;
    for (auto node : nodes()) {
      auto v = cpt(node).minNonZero();
      if (v < res) { res = v; }
    }
    return res;
  }

Here is the caller graph for this function:

minParam()

template<typename GUM_SCALAR >

GUM_SCALAR gum::IBayesNet< GUM_SCALAR >::minParam ( ) const

inherited

Returns

the smallest value in the CPTs of *this

Definition at line 105 of file IBayesNet_tpl.h.

                                                     {
    GUM_SCALAR res = 1.0;
    for (auto node : nodes()) {
      auto v = cpt(node).min();
      if (v < res) { res = v; }
    }
    return res;
  }

moralGraph()

const UndiGraph & gum::DAGmodel::moralGraph ( bool  clear = true ) const

inherited

The node's id are coherent with the variables and nodes of the topology.

Parameters

clear

If false returns the previously created moral graph.

Definition at line 101 of file DAGmodel.cpp.

References gum::DAGmodel::__moralGraph(), gum::DAGmodel::__mutableMoralGraph, and gum::UndiGraph::clear().

Referenced by gum::prm::SVED< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVE< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVED< GUM_SCALAR >::__eliminateNodesWithEvidence(), gum::prm::SVE< GUM_SCALAR >::__eliminateNodesWithEvidence(), gum::prm::SVED< GUM_SCALAR >::__initLiftedNodes(), gum::prm::SVE< GUM_SCALAR >::__initLiftedNodes(), and gum::DAGmodel::children().

                                                        {
    if (clear
        || (__mutableMoralGraph == nullptr)) {   // we have to call _moralGraph
      if (__mutableMoralGraph == nullptr) {
        __mutableMoralGraph = new UndiGraph();
      } else {
        // clear is True ,__mutableMoralGraph exists
        __mutableMoralGraph->clear();
      }

      __moralGraph();
    }

    return *__mutableMoralGraph;
  }

Here is the call graph for this function:

Here is the caller graph for this function:

nodeId()

template<typename GUM_SCALAR >

INLINE NodeId gum::BayesNet< GUM_SCALAR >::nodeId ( const DiscreteVariable &  var ) const

finalvirtual

Returns a variable's id in the gum::BayesNet.

Parameters

var	The variable from which the gum::NodeId is returned.

Returns

Returns the gum::DiscreteVariable gum::NodeId in the gum::BayesNet.

Exceptions

NotFound

If var is not in the gum::BayesNet.

Implements gum::IBayesNet< GUM_SCALAR >.

Definition at line 227 of file BayesNet_tpl.h.

Referenced by gum::credal::CredalNet< GUM_SCALAR >::__bnCopy(), and gum::BayesNet< double >::changeVariableLabel().

                                                                                {
    return __varMap.get(var);
  }

Here is the caller graph for this function:

nodes()

INLINE const NodeGraphPart & gum::DAGmodel::nodes ( ) const

inherited

Returns a constant reference to the dag of this Bayes Net.

Definition at line 115 of file DAGmodel_inl.h.

References gum::DAGmodel::_dag.

Referenced by gum::credal::CredalNet< GUM_SCALAR >::__bnCopy(), gum::EssentialGraph::__buildEssentialGraph(), gum::MarkovBlanket::__buildMarkovBlanket(), gum::DAGmodel::__moralGraph(), gum::credal::CredalNet< GUM_SCALAR >::__sort_varType(), gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::__verticesSampling(), gum::ImportanceSampling< GUM_SCALAR >::_unsharpenBN(), gum::BayesNetFactory< GUM_SCALAR >::BayesNetFactory(), gum::BayesNetFragment< GUM_SCALAR >::checkConsistency(), gum::learning::DAG2BNLearner< ALLOC >::createBN(), gum::MCBayesNetGenerator< GUM_SCALAR, ICPTGenerator, ICPTDisturber >::disturbBN(), gum::Estimator< GUM_SCALAR >::Estimator(), gum::getMaxModality(), gum::DAGmodel::hasSameStructure(), gum::DAGmodel::log10DomainSize(), gum::prm::InstanceBayesNet< GUM_SCALAR >::modalities(), gum::prm::ClassBayesNet< GUM_SCALAR >::modalities(), gum::Estimator< GUM_SCALAR >::setFromBN(), gum::prm::InstanceBayesNet< GUM_SCALAR >::toDot(), gum::prm::ClassBayesNet< GUM_SCALAR >::toDot(), gum::credal::CredalNet< GUM_SCALAR >::toString(), and gum::BayesNetFragment< GUM_SCALAR >::~BayesNetFragment().

                                                    {
    return (NodeGraphPart&)_dag;
  }

Here is the caller graph for this function:

operator!=()

template<typename GUM_SCALAR>

bool gum::IBayesNet< GUM_SCALAR >::operator!= ( const IBayesNet< GUM_SCALAR > &  from ) const

inherited

Returns

Returns false if the src and this are equal.

Definition at line 303 of file IBayesNet_tpl.h.

                                                                      {
    return !this->operator==(from);
  }

operator=()

template<typename GUM_SCALAR>

BayesNet< GUM_SCALAR > & gum::BayesNet< GUM_SCALAR >::operator=

(

const BayesNet< GUM_SCALAR > &

source

)

Copy operator.

Parameters

source

The copied BayesNet.

Returns

The copy of source.

Definition at line 180 of file BayesNet_tpl.h.

                                                                          {
    if (this != &source) {
      IBayesNet< GUM_SCALAR >::operator=(source);
      __varMap = source.__varMap;

      __clearPotentials();
      __copyPotentials(source);
    }

    return *this;
  }

operator==()

template<typename GUM_SCALAR>

bool gum::IBayesNet< GUM_SCALAR >::operator== ( const IBayesNet< GUM_SCALAR > &  from ) const

inherited

This operator compares 2 BNs !

Warning

To identify nodes between BNs, it is assumed that they share the same name.

Returns

true if the src and this are equal.

Definition at line 256 of file IBayesNet_tpl.h.

                                                                      {
    if (size() != from.size()) { return false; }

    if (sizeArcs() != from.sizeArcs()) { return false; }

    // alignment of variables between the 2 BNs
    Bijection< const DiscreteVariable*, const DiscreteVariable* > alignment;

    for (auto node : nodes()) {
      try {
        alignment.insert(&variable(node),
                         &from.variableFromName(variable(node).name()));
      } catch (NotFound&) {
        // a name is not found in from
        return false;
      }
    }

    for (auto node : nodes()) {
      NodeId fromnode = from.idFromName(variable(node).name());

      if (cpt(node).nbrDim() != from.cpt(fromnode).nbrDim()) { return false; }

      if (cpt(node).domainSize() != from.cpt(fromnode).domainSize()) {
        return false;
      }

      Instantiation i(cpt(node));
      Instantiation j(from.cpt(fromnode));

      for (i.setFirst(); !i.end(); i.inc()) {
        for (Idx indice = 0; indice < cpt(node).nbrDim(); ++indice) {
          const DiscreteVariable* p = &(i.variable(indice));
          j.chgVal(*(alignment.second(p)), i.val(*p));
        }

        if (std::pow(cpt(node).get(i) - from.cpt(fromnode).get(j), (GUM_SCALAR)2)
            > (GUM_SCALAR)1e-6) {
          return false;
        }
      }
    }

    return true;
  }

parents() [1/2]

INLINE const NodeSet & gum::DAGmodel::parents ( const NodeId  id ) const

inherited

returns the set of nodes with arc ingoing to a given node

Note that the set of arcs returned may be empty if no arc within the ArcGraphPart is ingoing into the given node.

Parameters

id	the node toward which the arcs returned are pointing

Definition at line 106 of file DAGmodel_inl.h.

References gum::DAGmodel::_dag, and gum::ArcGraphPart::parents().

Referenced by gum::MarkovBlanket::__buildMarkovBlanket(), gum::DAGmodel::__moralGraph(), gum::BayesNetFragment< GUM_SCALAR >::_installCPT(), gum::BayesNetFragment< GUM_SCALAR >::checkConsistency(), gum::DAGmodel::children(), gum::BayesNetFragment< GUM_SCALAR >::installCPT(), gum::DAGmodel::parents(), gum::prm::InstanceBayesNet< GUM_SCALAR >::toDot(), and gum::prm::ClassBayesNet< GUM_SCALAR >::toDot().

                                                               {
    return _dag.parents(id);
  }

Here is the call graph for this function:

Here is the caller graph for this function:

parents() [2/2]

const NodeSet& gum::DAGmodel::parents ( const std::string &  name ) const

inlineinherited

returns the set of nodes with arc ingoing to a given node

Note that the set of arcs returned may be empty if no arc within the ArcGraphPart is ingoing into the given node.

Parameters

id	the node toward which the arcs returned are pointing

Definition at line 156 of file DAGmodel.h.

References gum::DAGmodel::children(), gum::DAGmodel::idFromName(), and gum::DAGmodel::parents().

                                                        {
      return parents(idFromName(name));
    };

Here is the call graph for this function:

property()

INLINE const std::string & gum::DAGmodel::property ( const std::string &  name ) const

inherited

Return the value of the property name of this DAGModel.

Exceptions

NotFound

Raised if no name property is found.

Definition at line 37 of file DAGmodel_inl.h.

References gum::DAGmodel::__properties(), and GUM_ERROR.

Referenced by gum::InfluenceDiagram< GUM_SCALAR >::toDot().

                                                                 {
    try {
      return __properties()[name];
    } catch (NotFound&) {
      std::string msg = "The following property does not exists: ";
      GUM_ERROR(NotFound, msg + name);
    }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

propertyWithDefault()

INLINE const std::string & gum::DAGmodel::propertyWithDefault ( const std::string &  name, const std::string &  byDefault  ) const

inherited

Return the value of the property name of this DAGModel.

return byDefault if the property name is not found

Definition at line 48 of file DAGmodel_inl.h.

References gum::DAGmodel::__properties().

                                                                     {
    try {
      return __properties()[name];
    } catch (NotFound&) { return byDefault; }
  }

Here is the call graph for this function:

reverseArc() [1/3]

template<typename GUM_SCALAR >

INLINE void gum::BayesNet< GUM_SCALAR >::reverseArc	(	NodeId	tail,
		NodeId	head
	)

Reverses an arc while preserving the same joint distribution.

This method uses Shachter's 1986 algorithm for reversing an arc in the Bayes net while preserving the same joint distribution. By performing this reversal, we also add new arcs (required to not alter the joint distribution)

Exceptions

InvalidArc

exception if the arc does not exist or if its reversal would induce a directed cycle.

Definition at line 452 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::eraseArc(), and gum::BayesNet< double >::reverseArc().

                                                                         {
    reverseArc(Arc(tail, head));
  }

Here is the caller graph for this function:

reverseArc() [2/3]

template<typename GUM_SCALAR>

void gum::BayesNet< GUM_SCALAR >::reverseArc ( const std::string &  tail, const std::string &  head  )

inline

Reverses an arc while preserving the same joint distribution.

This method uses Shachter's 1986 algorithm for reversing an arc in the Bayes net while preserving the same joint distribution. By performing this reversal, we also add new arcs (required to not alter the joint distribution)

Exceptions

InvalidArc

exception if the arc does not exist or if its reversal would induce a directed cycle.

Definition at line 449 of file BayesNet.h.

                                                                  {
      reverseArc(idFromName(tail), idFromName(head));
    }

reverseArc() [3/3]

template<typename GUM_SCALAR >

void gum::BayesNet< GUM_SCALAR >::reverseArc

(

const Arc &

arc

)

Reverses an arc while preserving the same joint distribution.

This method uses Shachter's 1986 algorithm for reversing an arc in the Bayes net while preserving the same joint distribution. By performing this reversal, we also add new arcs (required to not alter the joint distribution)

Exceptions

InvalidArc

exception if the arc does not exist or if its reversal would induce a directed cycle.

Definition at line 386 of file BayesNet_tpl.h.

                                                        {
    // check that the arc exsists
    if (!__varMap.exists(arc.tail()) || !__varMap.exists(arc.head())
        || !dag().existsArc(arc)) {
      GUM_ERROR(InvalidArc, "a nonexisting arc cannot be reversed");
    }

    NodeId tail = arc.tail(), head = arc.head();

    // check that the reversal does not induce a cycle
    try {
      DAG d = dag();
      d.eraseArc(arc);
      d.addArc(head, tail);
    } catch (Exception&) {
      GUM_ERROR(InvalidArc, "this arc reversal would induce a directed cycle");
    }

    // with the same notations as Shachter (1986), "evaluating influence
    // diagrams",
    // p.878, we shall first compute the product of probabilities:
    // pi_j^old (x_j | x_c^old(j) ) * pi_i^old (x_i | x_c^old(i) )
    Potential< GUM_SCALAR > prod{cpt(tail) * cpt(head)};

    // modify the topology of the graph: add to tail all the parents of head
    // and add to head all the parents of tail
    beginTopologyTransformation();
    NodeSet new_parents;
    for (const auto node : this->parents(tail))
      new_parents.insert(node);
    for (const auto node : this->parents(head))
      new_parents.insert(node);
    // remove arc (head, tail)
    eraseArc(arc);

    // add the necessary arcs to the tail
    for (const auto p : new_parents) {
      if ((p != tail) && !dag().existsArc(p, tail)) { addArc(p, tail); }
    }

    addArc(head, tail);
    // add the necessary arcs to the head
    new_parents.erase(tail);

    for (const auto p : new_parents) {
      if ((p != head) && !dag().existsArc(p, head)) { addArc(p, head); }
    }

    endTopologyTransformation();

    // update the conditional distributions of head and tail
    Set< const DiscreteVariable* > del_vars;
    del_vars << &(variable(tail));
    Potential< GUM_SCALAR > new_cpt_head =
       prod.margSumOut(del_vars).putFirst(&variable(head));

    auto& cpt_head = const_cast< Potential< GUM_SCALAR >& >(cpt(head));
    cpt_head = std::move(new_cpt_head);

    Potential< GUM_SCALAR > new_cpt_tail{
       (prod / cpt_head).putFirst(&variable(tail))};
    auto& cpt_tail = const_cast< Potential< GUM_SCALAR >& >(cpt(tail));
    cpt_tail = std::move(new_cpt_tail);
  }

setProperty()

INLINE void gum::DAGmodel::setProperty ( const std::string &  name, const std::string &  value  )

inherited

Add or change a property of this DAGModel.

Definition at line 56 of file DAGmodel_inl.h.

References gum::DAGmodel::__properties(), and gum::HashTable< Key, Val, Alloc >::insert().

Referenced by gum::BayesNet< double >::fastPrototype().

                                                                          {
    try {
      __properties()[name] = value;
    } catch (NotFound&) { __properties().insert(name, value); }
  }

Here is the call graph for this function:

Here is the caller graph for this function:

size()

INLINE Size gum::DAGmodel::size ( ) const

inherited

Returns the number of variables in this Directed Graphical Model.

Definition at line 96 of file DAGmodel_inl.h.

References gum::DAGmodel::dag(), and gum::NodeGraphPart::size().

Referenced by gum::credal::CredalNet< GUM_SCALAR >::__initCNNets(), gum::InfluenceDiagram< GUM_SCALAR >::decisionNodeSize(), gum::DAGmodel::empty(), gum::MarkovBlanket::hasSameStructure(), gum::DAGmodel::hasSameStructure(), gum::IBayesNet< double >::operator==(), gum::prm::InstanceBayesNet< GUM_SCALAR >::toDot(), and gum::prm::ClassBayesNet< GUM_SCALAR >::toDot().

{ return dag().size(); }

Here is the call graph for this function:

Here is the caller graph for this function:

sizeArcs()

INLINE Size gum::DAGmodel::sizeArcs ( ) const

inherited

Returns the number of arcs in this Directed Graphical Model.

Definition at line 102 of file DAGmodel_inl.h.

References gum::DAGmodel::_dag, and gum::ArcGraphPart::sizeArcs().

Referenced by gum::MarkovBlanket::hasSameStructure(), gum::DAGmodel::hasSameStructure(), and gum::IBayesNet< double >::operator==().

{ return _dag.sizeArcs(); }

Here is the call graph for this function:

Here is the caller graph for this function:

toDot()

template<typename GUM_SCALAR >

std::string gum::IBayesNet< GUM_SCALAR >::toDot ( ) const

virtualinherited

Returns

Returns a dot representation of this IBayesNet.

Reimplemented in gum::BayesNetFragment< GUM_SCALAR >, gum::prm::ClassBayesNet< GUM_SCALAR >, and gum::prm::InstanceBayesNet< GUM_SCALAR >.

Definition at line 175 of file IBayesNet_tpl.h.

                                                 {
    std::stringstream output;
    output << "digraph \"";

    std::string bn_name;

    try {
      bn_name = this->property("name");
    } catch (NotFound&) { bn_name = "no_name"; }

    output << bn_name << "\" {" << std::endl;
    output << "  graph [bgcolor=transparent,label=\"" << bn_name << "\"];"
           << std::endl;
    output << "  node [style=filled fillcolor=\"#ffffaa\"];" << std::endl
           << std::endl;

    for (auto node : nodes())
      output << "\"" << variable(node).name() << "\" [comment=\"" << node << ":"
             << variable(node).toStringWithDescription() << "\"];" << std::endl;

    output << std::endl;

    std::string tab = "  ";

    for (auto node : nodes()) {
      if (children(node).size() > 0) {
        for (auto child : children(node)) {
          output << tab << "\"" << variable(node).name() << "\" -> "
                 << "\"" << variable(child).name() << "\";" << std::endl;
        }
      } else if (parents(node).size() == 0) {
        output << tab << "\"" << variable(node).name() << "\";" << std::endl;
      }
    }

    output << "}" << std::endl;

    return output.str();
  }

topologicalOrder()

const Sequence< NodeId > & gum::DAGmodel::topologicalOrder ( bool  clear = true ) const

inherited

The topological order stays the same as long as no variable or arcs are added or erased src the topology.

Parameters

clear

If false returns the previously created topology.

Definition at line 117 of file DAGmodel.cpp.

References gum::DAGmodel::dag(), and gum::DiGraph::topologicalOrder().

Referenced by gum::EssentialGraph::__buildEssentialGraph(), gum::InfluenceDiagramGenerator< GUM_SCALAR >::__checkTemporalOrder(), gum::DAGmodel::children(), gum::InfluenceDiagram< GUM_SCALAR >::decisionOrderExists(), and gum::InfluenceDiagram< GUM_SCALAR >::getDecisionOrder().

                                                                       {
    return this->dag().topologicalOrder(clear);
  }

Here is the call graph for this function:

Here is the caller graph for this function:

toString()

template<typename GUM_SCALAR >

INLINE std::string gum::IBayesNet< GUM_SCALAR >::toString ( ) const

inherited

Returns

Returns a string representation of this IBayesNet.

Definition at line 145 of file IBayesNet_tpl.h.

Referenced by gum::operator<<().

                                                           {
    Size   param = 0;
    double dSize = log10DomainSize();

    for (auto node : nodes())
      param += cpt(node).content()->realSize();

    double compressionRatio = log10(1.0 * param) - dSize;

    std::stringstream s;
    s << "BN{nodes: " << size() << ", arcs: " << dag().sizeArcs() << ", ";

    if (dSize > 6)
      s << "domainSize: 10^" << dSize;
    else
      s << "domainSize: " << std::round(std::pow(10.0, dSize));

    s << ", parameters: " << param << ", compression ratio: ";

    if (compressionRatio > -3)
      s << trunc(100.0 - std::pow(10.0, compressionRatio + 2.0));
    else
      s << "100-10^" << compressionRatio + 2.0;

    s << "% }";

    return s.str();
  }

Here is the caller graph for this function:

variable() [1/2]

template<typename GUM_SCALAR >

INLINE const DiscreteVariable & gum::BayesNet< GUM_SCALAR >::variable ( NodeId  id ) const

finalvirtual

Returns a gum::DiscreteVariable given its gum::NodeId in the gum::BayesNet.

Parameters

id	The variable's id to return.

Returns

Returns a constant reference of the gum::DiscreteVariable corresponding to id in the gum::BayesNet.

Exceptions

NotFound

Raised if id does not match a a variable in the gum::BayesNet.

Implements gum::IBayesNet< GUM_SCALAR >.

Definition at line 202 of file BayesNet_tpl.h.

Referenced by gum::credal::CredalNet< GUM_SCALAR >::__bnCopy(), gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization(), gum::BayesNetFactory< GUM_SCALAR >::BayesNetFactory(), gum::learning::genericBNLearner::Database::Database(), gum::BayesNet< double >::erase(), gum::getMaxModality(), gum::credal::CredalNet< GUM_SCALAR >::toString(), and gum::BayesNet< double >::variable().

                                                               {
    return __varMap.get(id);
  }

Here is the caller graph for this function:

variable() [2/2]

template<typename GUM_SCALAR>

const DiscreteVariable& gum::BayesNet< GUM_SCALAR >::variable ( const std::string &  name ) const

inline

Returns a gum::DiscreteVariable given its gum::NodeId in the gum::BayesNet.

Definition at line 297 of file BayesNet.h.

                                                                  {
      return variable(idFromName(name));
    };

variableFromName()

template<typename GUM_SCALAR >

INLINE const DiscreteVariable & gum::BayesNet< GUM_SCALAR >::variableFromName ( const std::string &  name ) const

finalvirtual

Returns a variable given its name in the gum::BayesNet.

Parameters

name	The variable's name in the gum::BayesNet.

Returns

Returns the gum::DiscreteVariable named name in the gum::BayesNet.

Exceptions

NotFound

Raised if name does not match a variable in the gum::BayesNet.

Implements gum::IBayesNet< GUM_SCALAR >.

Definition at line 309 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::changeVariableLabel(), and gum::BayesNet< double >::variableFromName().

                                                                                   {
    return __varMap.variableFromName(name);
  }

Here is the caller graph for this function:

variableNodeMap()

template<typename GUM_SCALAR >

INLINE const VariableNodeMap & gum::BayesNet< GUM_SCALAR >::variableNodeMap ( ) const

finalvirtual

Returns a map between variables and nodes of this gum::BayesNet.

Returns

Returns a constant reference to the gum::VariableNodeMap.

Implements gum::IBayesNet< GUM_SCALAR >.

Definition at line 320 of file BayesNet_tpl.h.

Referenced by gum::BayesNet< double >::cpt(), and gum::learning::DAG2BNLearner< ALLOC >::createBN().

                                                                              {
    return __varMap;
  }

Here is the caller graph for this function:

Friends And Related Function Documentation

BayesNetFactory< GUM_SCALAR >

template<typename GUM_SCALAR>

friend class BayesNetFactory< GUM_SCALAR >

friend

Definition at line 79 of file BayesNet.h.

Member Data Documentation

__probaMap

template<typename GUM_SCALAR>

NodeProperty< Potential< GUM_SCALAR >* > gum::BayesNet< GUM_SCALAR >::__probaMap

private

Mapping between the variable's id and their CPT.

Definition at line 654 of file BayesNet.h.

Referenced by gum::BayesNet< double >::__copyPotentials().

__varMap

template<typename GUM_SCALAR>

VariableNodeMap gum::BayesNet< GUM_SCALAR >::__varMap

private

the map between variable and id

Definition at line 651 of file BayesNet.h.

Referenced by gum::BayesNet< double >::operator=().

_dag

DAG gum::DAGmodel::_dag

protectedinherited

The DAG of this Directed Graphical Model.

Definition at line 203 of file DAGmodel.h.

Referenced by gum::prm::ClassBayesNet< GUM_SCALAR >::__get(), gum::InfluenceDiagram< GUM_SCALAR >::_addNode(), gum::InfluenceDiagram< GUM_SCALAR >::_copyTables(), gum::InfluenceDiagram< GUM_SCALAR >::_getChildrenDecision(), gum::BayesNetFragment< GUM_SCALAR >::_installArc(), gum::InfluenceDiagram< GUM_SCALAR >::_moralGraph(), gum::InfluenceDiagram< GUM_SCALAR >::_removeTables(), gum::BayesNetFragment< GUM_SCALAR >::_uninstallArc(), gum::InfluenceDiagram< GUM_SCALAR >::addArc(), gum::DAGmodel::arcs(), gum::DAGmodel::children(), gum::DAGmodel::dag(), gum::InfluenceDiagram< GUM_SCALAR >::erase(), gum::InfluenceDiagram< GUM_SCALAR >::eraseArc(), gum::InfluenceDiagram< GUM_SCALAR >::existsPathBetween(), gum::InfluenceDiagram< GUM_SCALAR >::getDecisionGraph(), gum::InfluenceDiagram< GUM_SCALAR >::getPartialTemporalOrder(), gum::BayesNetFragment< GUM_SCALAR >::installNode(), gum::DAGmodel::nodes(), gum::DAGmodel::operator=(), gum::DAGmodel::parents(), gum::DAGmodel::sizeArcs(), gum::InfluenceDiagram< GUM_SCALAR >::toDot(), and gum::BayesNetFragment< GUM_SCALAR >::uninstallNode().

---

The documentation for this class was generated from the following files:

• agrum/BN/BayesNet.h
• agrum/BN/BayesNet_tpl.h