Learning Bayesian belief networks based on the minimum description length principle: Basic properties

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E82-A, Issue 10, 1999, Pages 2237-2244

  Suzuki, Joe ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

Bayesian belief network; Chow and Liu algorithm; Cooper and herskovits procedure; MDL based procedure; Minimum description length principle; Stochastic rule learning

Indexed keywords

EID: 0008580731     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. H. Akaike, "A new look at the statistical model identification," IEEE Trans. on Automatic Control, vol.AC-19, no.6, pp.716-723, Dec. 1974.
2. R.E. Blahut, Principles and Practice of Information Theory, Addison-Weiley, 1987.
3. R.R. Bouckaert, "Probablistic network construction using the minimum description length principle," Tech. Rep., Utrecht University, RUU-CS-94-27, July 1994.
4. C.K. Chow and C.N. Liu, "Approximating discrete probability distributions with dependence trees," IEEE Trans. Inf. Theory, vol.IT-14, no.3, pp.462-467, May 1968.
5. B.S. Clarke and A.R. Barron, "Jeffreys prior is asymptotically least favorable under entropy risk," J. of Statistical Planning and Inference, 1994.
6. G.F. Cooper and E. Herskovits, "A Bayesian method for constructing Bayesian belief networks from database," Uncertainty in Artificial Intelligence '91, UCLA, CA, pp.86-94, July 1991.
7. R.M. Fung and S.L. Crawford, "Constructor: A system for the induction of probabilistic models," AAAI '90, pp.762-769, Boston, MA, July 1990.
8. D. Geiger, A. Paz, and J. Pearl, "Learning Causal Trees from Dependence Information," AAAI '90, pp.770-776, Boston, MA, July 1990.
9. H. Jeffreys, Theory of Probability, Oxford University Press, 1961.
10. W. Lam and F. Bacchus, "Using causal information and local measures to learn Bayesian networks," Uncertainty in Artificial Intelligence '93, pp.243-250, Washington D.C., July 1993.
11. J. Peral, Probabilistic Reasoning in Intelligent Systems, Morgan Kaufmann, San Mateo, CA, 1988.
12. G. Rebane and J. Pearl, "The recovery of causal poly-trees from statistical data," Uncertainty in Artificial Intelligence '87, pp.222-228, Seattle, Washington, July 1987.
13. J. Rissanen, "Stochastic complexity and modeling," The Annals of Statistics, vol.14, no.3, pp.1080-1100, 1986.
14. S. Srinivas, S. Russel, and A. Agogino, "Automated construction of sparse Bayesian networks for unstructured probabilistic models and domain information," in Uncertainty in Artificial Intelligence 5, eds. M. Henrion, R.D. Shachter, L.N. Kanal, and J.F. Lemmer, North-Holland, Amsterdam, pp.295-308, 1990.
15. J. Suzuki, Y. Ohdake, and S. Hirasawa, "On the selection method of stochastic models based on the minimum description length principle and the state decomposition," Transactions of Information Processing Society of Japan, vol.33, no.11, pp.1281-1289, 1992.
16. J. Suzuki, "Universal coding scheme minimizing minimax redundancy for sources with an unknown model," IEICE Trans. Fundamentals, vol.E76-A, no.7, pp.1234-1239, July 1993.
17. J. Suzuki, "Learning Bayesian belief networks based on the MDL principle: An efficient algorithm using the branch and bound technique," Int'l. Conf. on Machine Learning, Bari, Italy, July 1996.
18. T.S. Verma and J. Pearl, "Equivalence and synthesis of causal models" Uncertainty in Artificial Intelligence '90, pp.220-227, Cambridge, MA, July 1990.
19. C.S. Wallace and P.R. Freeman, "Estimation and inference by compact coding," J. Royal Stat. Soc. vol.B49, no.3, pp.240-265, 1987.
20. K. Yamanishi, "A learning criterion for stochastic rules," Machine Learning, vol.9, pp.165-203, 1992.