Propagating distributions on a hypergraph by dual information regularization

ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning

Volumn , Issue , 2005, Pages 921-928

  Tsuda, Koji ^a,b  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; INFORMATION THEORY;

HYPERGRAPH; INFORMATION REGULARIZATION; SEMI-SUPERVISED LEARNING;

LEARNING SYSTEMS;

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

References (16)

1. Akaho, S. (2004). The e-PCA and m-PCA: Dimension reduction of parameters by information geometry. Proceedings of 2004 IEEE International Joint Conference on Neural Networks (pp. 129-134).
2. Amari, S. (1995). Information geometry of the EM and em algorithms for neural networks. Neural Networks, 8, 1379-1408.
3. Amari, S., & Nagaoka, H. (2000). Methods of information geometry. Oxford: Oxford University Press.
4. Belkin, M., & Niyogi, P. (2003). Using manifold structure for partially labelled classification. Advances in Neural Information Processing Systems (NIPS) 15. MIT Press.
5. Chapelle, O., Weston, J., & Schölkopf, B. (2003). Cluster kernels for semi-supervised learning. Advances in Neural Information Processing Systems (NIPS) 15 (pp. 585-592). MIT Press.
6. Corduneanu, A., & Jaakkola, T. (2005). Distributed information regularization on graphs. Advances in Neural Information Processing Systems 17 (pp. 297-304). MIT Press.
7. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. New York: Wiley.
8. Lee, T. I., Rinaldi, N. J., Robert, F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. R., Thompson, C. M., Simon, I., Zeitlinger, J., Jennings, E. G., Murray, H. L., Gordon, D. B., Ren, B., Wyrick, J. J., Tagne, J., Volkert, T. L., Fraenkel, E., Gifford, D. K., & Young, R. A. (2002). Transcriptional regulatory networks in Saccharomyces cerevisiae. Science, 298, 799-804.
9. Tsuda, K., & Noble, W. (2004). Learning kernels from biological networks by maximizing entropy. Bioinformatica, 20, 1326-1333.
10. Vert, J., & Kanehisa, M. (2003). Graph-driven features extraction from microarray data using diffusion kernels and kernel CCA. Advances in Neural Information Processing Systems 15 (pp. 1425-1432). MIT Press.
11. von Mering, C., Krause, R., Snel, B., Cornell, M., Olivier, S. G., Fields, S., & Bork, P. (2002). Comparative assessment of large-scale data sets of protein-protein interactions. Nature, 417, 399-403.
12. Weston, J., Elisseeff, A., Zhou, D., Leslie, C., & Noble, W. (2004). Protein ranking: from local to global structure in the protein similarity network. Proc. Nat. Acad. Sci. USA, 101, 6559-6563.
13. Williams, C. K. I., & Barber, D. (1998). Bayesian classification with gaussian processes. IEEE Trans. PAMI., 20, 1342-1351.
14. Yona, G., Linial, N., & Linial, M. (1999). Protomap: Automatic classification of protein sequences, a hierarchy of protein families, and local maps of the protein space. Proteins: Structure, Function, and Genetics, 37, 360-678.
15. Zhou, D., Bousquet, O., Weston, J., & Schölkopf, B. (2004). Learning with local and global consistency. Advances in Neural Information Processing Systems (NIPS) 16 (pp. 321-328). MIT Press.
16. Zhu, X., Ghahramani, Z., & Lafferty, J. (2003). Semi-supervised learning using gaussian fields and harmonic functions. Proc. of the Twentieth International Conference on Machine Learning (ICML) (pp. 912-919). AAAI Press.