Marginal likelihood integrals for mixtures of independence models

Journal of Machine Learning Research

Volumn 10, Issue , 2009, Pages 1611-1631

  Lin, Shaowei ^a   Sturmfels, Bernd ^a   Xu, Zhiqiang ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

Computational algebra; Exact integration; Marginal likelihood; Mixture of independence model

Indexed keywords

ALGEBRAIC ALGORITHMS; BAYESIAN STATISTICS; COMPUTATIONAL ALGEBRA; DIRICHLET PRIOR; DISCRETE DATA; EXACT INTEGRATION; GEOMETRIC LANGUAGES; INDEPENDENCE MODELS; MARGINAL LIKELIHOOD; SMALL SAMPLE SIZE; STATISTICAL MODELS;

ALGEBRA; MIXTURES;

COMPUTATION THEORY;

EID: 68949164868     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. D.M. Chickering and D. Heckerman. Efficient approximations for the marginal likelihood of bayesian networks with hidden variables. Machine Learning, 29:181-212, 1997. Microsoft Research Report, MSR-TR-96-08.
2. D. Cox, J. Little, and D. O'Shea. Using Algebraic Geometry. Springer-Verlag, 2 edition, 2005.
3. M. Drton. Likelihood ratio tests and singularities. Ann. Statist., 37(2):979-1012, 2009.
4. M. Drton, B. Sturmfels, and S. Sullivant. Lectures on Algebraic Statistics, volume 39 of Oberwolfach Seminars. Birkhäuser, Basel, 2009.
5. M. Evans, Z. Gilula, and I. Guttman. Latent class analysis of two-way contingency tables by bayesian methods. Biometrika, 76:557-563, 1989.
6. S. Feinberg, P. Hersh, A. Rinaldo, and Y. Zhou. Maximum likelihood estimation in latent class models for contingency table data. arXiv:0709.3535, 2007.
7. W. Fulton. Introduction to Toric Varieties. Princeton Univ. Press, 1993.
8. S. Gao, G. Jiang, and M. Zhu. Solving the 100 swiss francs problem. arXiv:0809.4627, 2008.
9. D. Geiger and D. Rusakov. Asymptotic model selection for naive bayesian networks. Journal of Machine Learning Research, 6:1-35, 2005.
10. S. Hoşten, A. Khetan, and B. Sturmfels. Solving the likelihood equations. Foundations of Computational Mathematics, 5:389-407, 2005.
11. L. Pachter and B. Sturmfels. Algebraic Statistics for Computational Biology. Cambridge University Press, 2005.
12. R. Stanley. A zonotope associated with graphical degree sequences. In P. Gritzmann and B. Sturmfels, editors, Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, volume 4 of DIMACS Series in Discrete Mathematics, pages 555-570. Amer. Math. Soc., 1991.
13. B. Sturmfels. Open problems in algebraic statistics. In M. Putinar and S. Sullivant, editors, Emerging Applications of Algebraic Geometry, volume 149 of Volumes in Mathematics and its Applications, pages 351-364. I.M.A., 2008.
14. S. Watanabe. Algebraic analysis for nonidentifiable learning machines. Neural Computation, 13: 899-933, 2001.
15. S. Watanabe and K. Yamazaki. Singularities in mixture models and upper bounds of stochastic complexity. International Journal of Neural Networks, 16:1029-1038, 2003.
16. S. Watanabe and K. Yamazaki. Newton diagram and stochastic complexity in mixture of binomial distributions. In Algorithmic Learning Theorem, volume 3244 of Lecture Notes in Computer Science, pages 350-364. Springer, 2004.
17. G. Ziegler. Lectures on Polytopes. Springer-Verlag, 1995.