Memory-Efficient Dynamic Programming for Learning Optimal Bayesian Networks

@inproceedings{Malone2011MemoryEfficientDP,
  title={Memory-Efficient Dynamic Programming for Learning Optimal Bayesian Networks},
  author={Brandon M. Malone and Changhe Yuan and Eric A. Hansen},
  booktitle={AAAI},
  year={2011}
}
We describe a memory-efficient implementation of a dynamic programming algorithm for learning the optimal structure of a Bayesian network from training data. The algorithm leverages the layered structure of the dynamic programming graphs representing the recursive decomposition of the problem to reduce the memory requirements of the algorithm from O(n2) to O(C(n, n/2)), where C(n, n/2) is the binomial coefficient. Experimental results show that the approach runs up to an order of magnitude… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS
17 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

The Art of Computer Programming, Volume 4, Fascicles 0-4

  • D. E. Knuth
  • Addison-Wesley Professional, 1st edition.
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…