Learning factor graphs in polynomial time & sample complexity

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 1-9

  Abbeel, Pieter ^a   Koller, Daphne ^a   Ng, Andrew Y ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIAL APPROXIMATION;

GRAPHICAL MODEL; LEARNING FACTOR; MARKOV NETWORKS; NETWORK STRUCTURES; POLYNOMIAL NUMBER; SAMPLE COMPLEXITY; STRUCTURE-LEARNING; UNDERLYING NETWORKS;

COMPLEX NETWORKS;

EID: 80053202166     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Abbeel, P., Koller, D., & Ng, A. Y. (2005). On the sample complexity of graphical models. (Full paper.) http://www.cs.stanford.edu/~pabbeel/.
2. Bach, F., & Jordan, M. (2002). Thin junction trees. NIPS 14.
3. Besag, J. (1974). Spatial interaction and the statistical analysis of lattice systems. Journal of the Royal Statistical Society, Series B.
4. Cheng, J., Greiner, R., Kelly, J., Bell, D., & Liu, W. (2002). Learning Bayesian networks from data: An information-theory based approach. Artificial Intelligence Journal.
5. Chickering, D. (1996). Learning Bayesian networks is NP Complete. In D. Fisher and H. Lenz (Eds.), Learning from data: Artificial intelligence and statistics v,121-130. Springer-Verlag.
6. Chickering, D., & Meek, C. (2002). Finding optimal Bayesian networks. Proc. UAI.
7. Chickering, D., Meek, C., & Heckerman, D. (2003). Largesample learning of Bayesian networks is hard. Proc. UAI.
8. Chow, C. K., & Liu, C. N. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory.
9. Comets, F. (1992). On consistency of a class of estimators for exponential families of Markov random fields on the lattice. Annals of Statistics.
10. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. Wiley.
11. Dasgupta, S. (1997). The sample complexity of learning fixed structure Bayesian networks. Machine Learning.
12. Dasgupta, S. (1999). Learning polytrees. Proc. UAI.
13. Della Pietra, S., Della Pietra, V. J., & Lafferty, J. D. (1997). Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19, 380-393.
14. Deshpande, A., Garofalakis, M. N., & Jordan, M. I. (2001). Efficient stepwise selection in decomposable models. Proc. UAI (pp. 128-135). Morgan Kaufmann Publishers Inc.
15. Friedman, N., & Yakhini, Z. (1996). On the sample complexity of learning Bayesian networks. Proc. UAI.
16. Geman, S., & Graffigne, C. (1986). Markov random field image models and their applications to computer vision. Proc. of the International Congress of Mathematicians.
17. Guyon, X., & Künsch, H. (1992). Asymptotic comparison of estimators in the ising model. In Stochastic models, statistical methods, and algorithms in image analysis, lecture notes in statistics. Springer, Berlin.
18. Hammersley, J. M., & Clifford, P. (1971). Markov fields on finite graphs and lattices. Unpublished.
19. Hoffgen, K. L. (1993). Learning and robust learning of product distributions. Proc. COLT.
20. Huang, F., & Ogata, Y. (2002). Generalized pseudo-likelihood estimates for Markov random fields on lattice. Annals of the Institute of Statistical Mathematics.
21. Ji, C., & Seymour, L. (1996). A consistent model selection procedure for Markov random fields based on penalized pseudolikelihood. Annals of Applied Probability.
22. Kschischang, F. R., Frey, B. J., & Loeliger, H. A. (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory.
23. Lauritzen, S. L. (1996). Graphical models. Oxford University Press.
24. Malvestuto, F.M. (1991). Approximating discrete probability distributions with decomposable models. IEEE Transactions on Systems, Man and Cybernetics.
25. McCallum, A. (2003). Efficiently inducing features of conditional random fields. Proc. UAI.
26. Meek, C. (2001). Finding a path is harder than finding a tree. Journal of Artificial Intelligence Research, 15, 383-389.
27. Narasimhan, M., & Bilmes, J. (2004). PAC-learning bounded tree-width graphical models. Proc. UAI.
28. Spirtes, P., Glymour, C., & Scheines, R. (2000). Causation, prediction, and search (second edition). MIT Press.
29. Srebro, N. (2001). Maximum likelihood bounded tree-width Markov networks. Proc. UAI.