algorithms4 dataset

algorithms Bayesian Networks

algorithms Bayesian Networks

Entropy and the Kullback-Leibler divergence for Bayesian networks: Computational complexity and efficient implementation. data

Format

A discrete Bayesian network to illustrate the algorithms developed in the associated paper (Figure 2, bottom). The probabilities were available from a repository. The vertices are:

  • X1: (a, b);
  • X2: (c, d);
  • X3: (e, f);
  • X4: (g, h);

Returns

An object of class bn.fit. Refer to the documentation of bnlearn for details.

References

Scutari, M. (2024). Entropy and the Kullback-Leibler Divergence for Bayesian Networks: Computational Complexity and Efficient Implementation. Algorithms, 17(1), 24.

  • Maintainer: Manuele Leonelli
  • License: MIT + file LICENSE
  • Last published: 2025-04-09

About the dataset

  • Number of columns: 4
  • Class: bn.fit, bn.fit.dnet

Column names and types

  • X1:bn.fit.dnode
  • X2:bn.fit.dnode
  • X3:bn.fit.dnode
  • X4:bn.fit.dnode