Random spanning trees and the prediction of weighted graphs

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 175-182

  Cesa Bianchi, Nicolò ^a   Gentile, Claudio ^b   Vitale, Fabio ^a   Zappella, Giovanni ^a  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT AMORTIZED TIME; LINEAR SPACES; MISTAKE BOUNDS; PERCEPTRON; RANDOM SPANNING TREE; RANDOMIZED ALGORITHMS; REAL-WORLD DATASETS; WEIGHTED GRAPH;

GRAPHIC METHODS; LEARNING SYSTEMS; PARALLEL ARCHITECTURES;

TREES (MATHEMATICS);

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

References (21)

1. Alon, N., Avin, C., Koucký, M., Kozma, G., Lotker, Z., and Tuttle, M.R. Many random walks are faster than one. In Proc. 20th Symp. on Parallel Algo. and Architectures, pp. 119-128. Springer, 2008.
2. Belkin, M., Matveeva, I., and Niyogi, P. Regularization and semi-supervised learning on large graphs. In Proc. 17th COLT, pp. 624-638. Springer, 2004.
3. Bengio, Y., Delalleau, O., and Le Roux, N. Label propagation and quadratic criterion. In Semi-Supervised Learning, pp. 193-216. MIT Press, 2006.
4. Blum, A. and Chawla, S. Learning from labeled and unlabeled data using graph mincuts. In Proc. 18th ICML, pp. 19-26. Morgan Kaufmann, 2001.
5. Cesa-Bianchi, N., Gentile, C., and Vitale, F. Fast and optimal prediction of a labeled tree. In Proc. 22nd COLT. Omnipress, 2009.
6. Cesa-Bianchi, N., Gentile, C., Vitale, F., Zappella, G. Random spanning trees and the prediction of weighted graphs. Technical Report, Università degli Studi di Milano & Università dell'Insubria, 2010.
7. Chang, H. and Yeung, D.Y. Graph Laplacian kernels for object classification from a single example. In 2006 IEEE CVPR, pp. 12011-2016. IEEE Press, 2006.
8. Gavin, A.-C. et al. Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature, 415(6868):141-147, 2002.
9. Goldberg, A. and Zhu, X. Seeing stars when there aren't many stars: Graph-based semi-supervised learning for sentiment categorization. In HLT-NAACL 2006 Workshop on Textgraphs: Graph-based algorithms for NLP, 2004.
10. Herbster, M. and Pontil, M. Prediction on a graph with the Perceptron. In NIPS 21, pp. 577-584. MIT Press, 2007.
11. Herbster, M., Lever, G., and Pontil, M. Online prediction on large diameter graphs. In NIPS 22. MIT Press, 2009a.
12. Herbster, M., Pontil, M., and Rojas-Galeano, S. Fast prediction on a tree. In NIPS 22. MIT Press, 2009b.
13. Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., and Sakaki, Y. A comprehensive two-hybrid analysis to explore the yeast protein interactome. PNAS, 8(98):4569-4574, 2001.
14. Krogan, N.J. et al. Global landscape of protein complexes in the yeast Saccharomyces cerevisiae. Nature, 440:637-643, 2006.
15. Lyons, R. and Peres, Y. Probability on trees and networks. Manuscript, 2009.
16. Pandey, G., Steinbach, M., Gupta, R., Garg, T., and Kumar, V. Association analysis-based transformations for protein interaction networks: a function prediction case study. In Proc. 13th ACM KDD, pp. 540-549. ACM Press, 2007.
17. Ruepp, A. The FunCat, a functional annotation scheme for systematic classification of proteins from whole genomes. Nucleic Acids Research, 32(18): 5539-5545, 2004.
18. Tsuda, H. Shin K. and Schölkopf, B. Protein functional class prediction with a combined graph. Expert Systems with Applications, 36:3284-3292, 2009.
19. Uetz, P. et al. Pa comprehensive analysis of protein-protein interactions in Saccharomyces cerevisiae. Nature, 6770(403):623-627, 2000.
20. Wilson, D.B. Generating random spanning trees more quickly than the cover time. In Proc. 28th ACM STOC, pp. 296-303. ACM Press, 1996.
21. Zhu, X., Ghahramani, Z., and Lafferty, J. Semi-supervised learning using Gaussian fields and harmonic functions. In ICML Workshop on the Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining, 2003.