Comparison of score metrics for Bayesian network learning

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 32, Issue 3, 2002, Pages 419-427

  Yang, Shulin ^a   Chang, Kuo Chu ^a  

^a Krasnow Institute for Advanced Study   (United States)

Author keywords

Bayesian network learning; Conditional probability; Cross entropy; Database; Dirichlet distribution; Joint probability

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; LEARNING SYSTEMS; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY; PROBABILITY DENSITY FUNCTION;

BAYESIAN NETWORK LEARNING; CONDITIONAL PROBABILITY; CROSS-ENTROPY; DIRICHLET PRIOR SCORE METRIC; JOINT PROBABILITY;

LEARNING ALGORITHMS;

EID: 0036589503     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2002.803772     Document Type: Letter

References (18)

1. R. R. Bouckaert, "Probabilistic network construction using the minimum description length principle," Utrecht Univ., Utrecht, The Netherlands, Rep. RUU-CS-94-27, 1990.
2. W. Buntine, "Theory refinement on Bayesian networks," in Proc. 7th Conf. Uncertainty in Artificial Intelligence, Los Angeles, CA, 1991, pp. 52-60.
3. ____, "A guide to the literature on learning probabilistic networks from data," IEEE Trans. Knowledge Data Eng., 1996.
4. D. M. Chickering, D. Geiger, and D. Heckerman, "Learning Bayesian networks is NP-hard," Microsoft Corporation, Rep. MSR-TR=94-17, 1994.
5. G. F. Cooper and E. Herskovits, "A Bayesian method for the induction of probabilistic networks from data," Mach. Learn., vol. 7, pp. 299-347, 1992.
6. M. H. deGroot, Optimal Statistical Decisions. New York: McGraw-Hill, 1970.
7. A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. R. Stat. Soc. B, vol. 39, pp. 1-38, 1977.
8. D. Heckerman, D. Geiger, and D. M. Chickering, "Learning Bayesian networks: The combination of knowledge and statistical data," Mach. Learn., vol. 20, no. 3, pp. 197-243, 1995.
9. D. Heckerman, "A tutorial on learning with Bayesian networks," Microsoft Corporation, Rep. MSR-TR-95-06, 1995.
10. E. Herskovits, "Computer-based probabilistic-network construction," Ph.D. dissertation, Univ. of Pittsburgh, Pittsburgh, PA, 1991.
11. S. Kullback and R. Leibler, "Annals of mathematics statistics," Inf. Sufficiency, vol. 22, pp. 79-86, 1951.
12. G. Rebane and J. Pearl, "The recovery of causal poly-trees from statistical data," in Proc. Workshop Uncertainty in Artificial Intelligence, Seattle, WA, 1987, pp. 222-228.
13. J. Rissanen, "Annals of statistics," Stoch. Complex. Model., vol. 14, no. 3, pp. 1080-1100, 1986.
14. ____, "Stochastic complexity," J. R. Stat. Soc. B, vol. 49, no. 3, pp. 223-239, 1987.
15. R. W. Robinson, "Counting unlabeled acyclic digraphs," in Lecture Notes in Mathematics, 622: Combinatorial Mathematics V, C. H. C. Little, Ed. New York: Springer-Verlag, 1977.
16. G. Schwartz, "The annals of statistics," Estimating Dimension of a Model, vol. 6, no. 2, pp. 461-464, 1978.
17. T. S. Verma and J. Pearl, "Equivalence and synthesis of causal models," in Proc. 6th Conf. Uncertainty in Artificial Intelligence, Cambridge, MA, 1990, pp. 220-227.
18. S. Yang and K. C. Chang, "On the joint probability of Bayesian network structure and database," George Mason Univ., Fairfax, VA, Rep. GMU-C3I-95-03, 1995.