67 template <
typename GUM_SCALAR >
70 #define GAP_COMPLEXITY_KL_HEAVY_DIFFICULT double(12.0) 71 #define GAP_COMPLEXITY_KL_DIFFICULT_CORRECT double(7.0) 78 BNdistance(
const IBayesNet< GUM_SCALAR >& P,
const IBayesNet< GUM_SCALAR >& Q);
82 BNdistance(
const BNdistance< GUM_SCALAR >& kl);
85 virtual ~BNdistance();
117 double bhattacharya();
124 const IBayesNet< GUM_SCALAR >& p()
const;
127 const IBayesNet< GUM_SCALAR >& q()
const;
133 virtual void _computeKL();
149 bool __checkCompatibility()
const;
155 #ifndef GUM_NO_EXTERN_TEMPLATE_CLASS Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
const IBayesNet< GUM_SCALAR > & _p
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Class representing the minimal interface for Bayesian Network.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Complexity
Complexity allows to characterize the awaited difficulty for an algorithm given a specific instance T...
const IBayesNet< GUM_SCALAR > & _q
std::size_t Size
In aGrUM, hashed values are unsigned long int.