![]() |
aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
|
algorithm for KL divergence between BNs More...
Go to the source code of this file.
Classes | |
| class | gum::BNdistance< GUM_SCALAR > |
Namespaces | |
| namespace | gum |
| gum is the global namespace for all aGrUM entities | |
Macros | |
| #define | GAP_COMPLEXITY_KL_HEAVY_DIFFICULT double(12.0) |
| #define | GAP_COMPLEXITY_KL_DIFFICULT_CORRECT double(7.0) |
Enumerations | |
| enum class | gum::Complexity : char { gum::Heavy , gum::Difficult , gum::Correct } |
| Complexity allows to characterize the awaited difficulty for an algorithm given a specific instance Therefore this is not a theoretical characterization but rather a pragmatic rate of that very instance. More... | |
algorithm for KL divergence between BNs
Definition in file BNdistance.h.
| #define GAP_COMPLEXITY_KL_DIFFICULT_CORRECT double(7.0) |
Definition at line 89 of file BNdistance.h.
Referenced by gum::BNdistance< GUM_SCALAR >::BNdistance().
| #define GAP_COMPLEXITY_KL_HEAVY_DIFFICULT double(12.0) |
Definition at line 88 of file BNdistance.h.
Referenced by gum::BNdistance< GUM_SCALAR >::BNdistance().