Learning with partially absorbing random walks

Advances in Neural Information Processing Systems

Volumn 4, Issue , 2012, Pages 3077-3085

  Wu, Xiao Ming ^a   Li, Zhenguo ^a   So, Anthony Man Cho ^b   Wright, John ^a   Chang, Shih Fu ^a  

^a Columbia University ^*  (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ABSORPTION PROBABILITIES; ABSORPTION RATES; CLUSTER ASSUMPTIONS; GRAPH STRUCTURES; GRAPH-BASED LEARNING; RANDOM EDGES; RANDOM WALK;

GRAPHIC METHODS;

RANDOM PROCESSES;

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

References (20)

1. R. Andersen and F. Chung. Detecting sharp drops in pagerank and a simplified local partitioning algorithm. Theory and Applications of Models of Computation, pages 1-12, 2007.
2. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, pages 475-486, 2006.
3. Y. Bengio, O. Delalleau, and N. Le Roux. Label propagation and quadratic criterion. Semi-supervised learning, pages 193-216, 2006.
4. P. Berkhin. Bookmark-coloring algorithm for personalized pagerank computing. Internet Mathematics, 3(1):41-62, 2006.
5. O. Chapelle and A. Zien. Semi-supervised classification by low density separation. In AISTATS, 2005.
6. F. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
7. R. Coifman and S. Lafon. Diffusion maps. Applied and Computational Harmonic Analysis, 21(1):5-30, 2006.
8. F. Fouss, A. Pirotte, J. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19(3):355-369, 2007.
9. J. Kemeny and J. Snell. Finite markov chains. Springer, 1976.
10. B. Kveton, M. Valko, A. Rahimi, and L. Huang. Semisupervised learning with max-margin graph cuts. In AISTATS, pages 421-428, 2010.
11. L. Lovász and M. Simonovits. The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In FOCS, pages 346-354, 1990.
12. M. Meila and J. Shi. A random walks view of spectral segmentation. In AISTATS, 2001.
13. B. Nadler, N. Srebro, and X. Zhou. Statistical analysis of semi-supervised learning: The limit of infinite unlabelled data. In NIPS, pages 1330-1338, 2009.
14. L. Page, S. Brin, R. Motwani, and T.Winograd. The pagerank citation ranking: Bringing order to the web. 1999.
15. D. A. Spielman and S.-H. Teng. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR, abs/0809.3232, 2008.
16. U. Von Luxburg, A. Radl, and M. Hein. Hitting and commute times in large graphs are often misleading. Arxiv preprint arXiv:1003.1266, 2010.
17. D. Zhou, O. Bousquet, T. Lal, J. Weston, and B. Schölkopf. Learning with local and global consistency. In NIPS, pages 595-602, 2004.
18. D. Zhou, J. Weston, A. Gretton, O. Bousquet, and B. Schölkopf. Ranking on data manifolds. In NIPS, 2004.
19. X. Zhu and Z. Ghahramani. Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University, 2002.
20. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, 2003.