The Sample Complexity of Learning Fixed-Structure Bayesian Networks

Machine Learning

Volumn 29, Issue 2-3, 1997, Pages 165-180

  Dasgupta, Sanjoy ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bayesian networks; PAC learning; Sample complexity

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBABILITY;

BAYESIAN NETWORKS; SAMPLE COMPLEXITY;

LEARNING SYSTEMS;

EID: 0031269467     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1007417612269     Document Type: Article

References (10)

1. Abe, N., Takeuchi, J., & Warmuth M. (1990). Polynomial learnability of probabilistic concepts with respect to the Kullback-Leibler divergence. ACM Conference on Computational Learning Theory. San Mateo, CA: Morgan Kaufmann.
2. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. New York: John Wiley.
3. Dudley, R. M. (1978). Central limit theorems for empirical measures. Annals of Probability, 6, 899-929.
4. Friedman, N., & Yakhini, Z. (1996). On the sample complexity of learning Bayesian networks. Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence. San Mateo, CA: Morgan Kaufmann.
5. Haussler, D. (1992). Decision-theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100, 78-150.
6. Pearl, J. (1988). Probabilistic reasoning in intelligent systems. San Mateo, CA: Morgan Kaufmann.
7. Pollard, D. (1984). Convergence of stochastic processes. New York: Springer-Verlag.
8. Russell, S., Binder, J., Koller, D., & Kanazawa, K. (1995). Local learning in probabilistic networks with hidden variables. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Los Altos, CA: William Kaufmann.
9. Valiant, L. (1984). A theory of the learnable. Communications of the ACM, 27, 1134-1142.
10. Vapnik, V. N. (1982). Estimation of dependencies based on empirical data. New York: Springer-Verlag.