The em algorithm for kernel matrix completion with auxiliary data

Journal of Machine Learning Research

Volumn 4, Issue 1, 2004, Pages 67-81

  Tsuda, Koji ^a,b   Akaho, Shotaro ^b   Asai, Kiyoshi ^b,c  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^c UNIVERSITY OF TOKYO   (Japan)

Author keywords

Bacteria clustering; Em algorithm; Information geometry; Kernel matrix completion

Indexed keywords

ALGORITHMS; BACTERIA; DATABASE SYSTEMS; INFORMATION ANALYSIS; MATRIX ALGEBRA; SET THEORY;

BACTERIA CLUSTERING; KERNEL MATRIX;

LEARNING SYSTEMS;

EID: 2342585524     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244304322765649     Document Type: Article

References (28)

1. S. Amari. Information geometry of the EM and em algorithms for neural networks. Neural Networks, 8(9): 1379-1408, 1995.
2. S. Amari and H. Nagaoka. Methods of Information Geometry, volume 191 of Translations of Mathematical Monographs. American Mathematical Society, 2001.
3. H. Attias. Inferring parameters and structure of latent variable models by variational Bayes. In Uncertainty in Artificial Intelligence: Proceedings of the Fifteenth Conference (UAI-1999), pages 21-30, San Francisco, CA, 1999. Morgan Kaufmann Publishers.
4. O. Bousquet and D.J.L. Herrmann. On the complexity of learning the kernel matrix. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15. MIT Press, 2003. to appear.
5. T.A. Brown. Genomes. Wiley, 2nd edition, 2002.
6. N. Cristianini, J. Shawe-Taylor, J. Kandola, and A. Elisseeff. On kernel-target alignment. In T.G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, pages 367-373. MIT Press, 2002.
7. L. Csató and M. Opper. Sparse online gaussian processes. Neural Computation, 14(3):641-668, 2002.
8. I. Csiszár and G. Tusnady. Information geometry and alternating minimization procedures. Statistics and Decisions, 1:205-237, 1984.
9. A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the em algorithm. J. Roy. Stat. Soc. B, 39:1-38, 1977.
10. T. Graepel. Kernel matrix completion by semidefinite programming. In J.R. Dorronsoro, editor, Artificial Neural Networks - ICANN 2002, pages 687-693. Springer Verlag, 2002.
11. L. Hubert and P. Arabie. Comparing partitions. J. Classif., pages 193-218, 1985.
12. S. Ikeda, S. Amari, and H. Nakahara. Convergence of the wake-sleep algorithm. In M.S. Kearns, S.A. Solla, and D.A. Cohn, editors, Advances in Neural Information Processing Systems 11, pages 239-245. MIT Press, 1999.
13. H. Kasai, A. Bairoch, K. Watanabe, K. Isono, S. Harayama, E. Gasteiger, and S. Yamamoto. Construction of the gyrB database for the identification and classification of bacteria. In Genome Informatics 1998, pages 13-21. Universal Academic Press, 1998.
14. G. Lanckriet, N. Cristianini, P. Bartlett, L. El Ghaoui, and M.I. Jordan. Learning the kernel matrix with semi-definite programming. In C. Sammut and A.G. Hoffmann, editors, Proceedings of the 19th International Conference on Machine Learning, pages 323-330. Morgan Kaufmann, 2002.
15. R.M. Neal and G.E. Hinton. A new view of the EM algorithm that justifies incremental and other variants. In M.I. Jordan, editor, Learning in Graphical Models, pages 355-368. MIT Press, 1999.
16. A. Ohara. Information geometric analysis of an interior point method for semidefinite programming. In O.E. Barndorff-Nielsen and E.B. Vedel Jensen, editors, Geometry in Present Day Science, pages 49-74. World Scientific, 1999.
17. A. Ohara, N. Suda, and S. Amari. Dualistic differential geometry of positive definite matrices and its applications to related problems. Linear Algebra and Its Applications, 247:31-53, 1996.
18. C.P. Robert. The Bayesian Choice: A Decision-Theoretic Motivation. Springer Verlag, 1994.
19. B. Schölkopf and A. J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
20. M. Seeger. Covariance kernels from Bayesian generative models. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, pages 905-912, Cambridge, MA, 2002. MIT Press.
21. M.E. Tipping and C.M. Bishop. Probabilistic principal component analysis. Journal of the Royal Statistical Society, Series B, 61(3):611-622, 1999.
22. K. Tsuda, T. Kin, and K. Asai. Marginalized kernels for biological sequences. Bioinformatics, 18(Suppl. 1): S268-S275, 2002.
23. S. Vaithyanathan and B. Dom. Model selection in unsupervised learning with applications to document clustering. In I. Bratko and S. Dzeroski, editors, Proceedings of 16th International Conference on Machine Learning (ICML), pages 433-443. Morgan Kaufmann, 1999.
24. V.N. Vapnik. Statistical Learning Theory. Wiley, New York, 1998.
25. J.-P. Vert and M. Kanehisa. Graph-driven features extraction from microarray data using diffusion kernels and kernel CCA. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15. MIT Press, 2003. to appear.
26. C.K.I. Williams. Prediction with gaussian processes: From linear regression to linear prediction and beyond. In M.I. Jordan, editor, Learning in Graphical Models, pages 599-621. MIT Press, 1999.
27. S. Yamamoto, H. Kasai, D.L. Arnold, R.W. Jackson, A. Vivian, and S. Harayama. Phylogeny of the genus Pseudomonas: intrageneric structure reconstructed from the nucleotide sequences of gyrB and rpoD genes. Microbiology, 146:2385-2394, 2000.
28. K.Y. Yeung and W.L. Ruzzo. Principal component analysis for clustering gene expression data. Bioinformatics, 17(9):763-774, 2001.