See the tree through the lines: The SHAZOO algorithm

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

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

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

ENERGY MINIMIZATION METHODS; GENERALISATION; GRAPH SPARSIFICATION; REAL-WORLD DATASETS; SPANNING TREE; WEIGHTED TREE;

TREES (MATHEMATICS);

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

References (18)

1. N. Alon, C. Avin, M. Koucký, G. Kozma, Z. Lotker, and M.R. Tuttle. Many random walks are faster than one. In Proc. 20th Symp. on Parallel Algo. and Architectures, pages 119-128. Springer, 2008.
2. M. Belkin, I. Matveeva, and P. Niyogi. Regularization and semi-supervised learning on large graphs. In Proceedings of the 17th Annual Conference on Learning Theory, pages 624-638. Springer, 2004.
3. Y. Bengio, O. Delalleau, and N. Le Roux. Label propagation and quadratic criterion. In Semi-Supervised Learning, pages 193-216. MIT Press, 2006.
4. A. Blum and S. Chawla. Learning from labeled and unlabeled data using graph mincuts. In Proceedings of the 18th International Conference on Machine Learning. Morgan Kaufmann, 2001.
5. N. Cesa-Bianchi, C. Gentile, and F. Vitale. Fast and optimal prediction of a labeled tree. In Proceedings of the 22nd Annual Conference on Learning Theory, 2009.
6. N. Cesa-Bianchi, C. Gentile, F. Vitale, and G. Zappella. Random spanning trees and the prediction of weighted graphs. In Proceedings of the 27th International Conference on Machine Learning, 2010.
7. C. Altafini G. Iacono. Monotonicity, frustration, and ordered response: an analysis of the energy landscape of perturbed large-scale biological networks. BMC Systems Biology, 4(83), 2010.
8. M. Herbster and G. Lever. Predicting the labelling of a graph via minimum p-seminorm interpolation. In Proceedings of the 22nd Annual Conference on Learning Theory. Omnipress, 2009.
9. M. Herbster, G. Lever, and M. Pontil. Online prediction on large diameter graphs. In Advances in Neural Information Processing Systems 22. MIT Press, 2009.
10. M. Herbster, M. Pontil, and S. Rojas-Galeano. Fast prediction on a tree. In Advances in Neural Information Processing Systems 22. MIT Press, 2009.
11. F.R. Kschischang, B.J. Frey, and H.A. Loeliger. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2):498-519, 2001.
12. R. Lyons and Y. Peres. Probability on trees and networks. Manuscript, 2008.
13. S.T. McCormick, M.R. Rao, and G. Rinaldi. Easy and difficult objective functions for max cut. Math. Program., 94(2-3):459-466, 2003.
14. G. Pandey, M. Steinbach, R. Gupta, T. Garg, and V. Kumar. Association analysis-based transformations for protein interaction networks: a function prediction case study. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 540-549. ACM Press, 2007.
15. Yahoo! Research (Barcelona) and Laboratory of Web Algorithmics (Univ. of Milan). Web spam collection. URL: barcelona.research.yahoo.net/webspam/datasets/ .
16. D. A. Spielman and N. Srivastava. Graph sparsification by effective resistances. In Proc. of the 40th annual ACM symposium on Theory of computing (STOC 2008). ACM Press, 2008.
17. D.B.Wilson. Generating random spanning trees more quickly than the cover time. In Proceedings of the 28th ACM Symposium on the Theory of Computing, pages 296-303. ACM Press, 1996.
18. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In Proceedings of the 20th International Conference on Machine Learning, 2003.