Learning on graph with Laplacian regularization

Advances in Neural Information Processing Systems

Volumn , Issue , 2007, Pages 25-32

  Ando, Rie Kubota ^a   Zhang, Tong ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b YAHOO INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION PERFORMANCE; DIMENSION REDUCTION; GENERALIZATION BOUND; GEOMETRIC PROPERTIES; GRAPH LAPLACIAN; LAPLACIANS; TRANSDUCTIVE LEARNING;

MATRIX ALGEBRA;

LAPLACE TRANSFORMS;

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

References (8)

1. M. Belkin and P. Niyogi. Semi-supervised learning on Riemannian manifolds. Machine Learning, Special Issue on Clustering:209-239, 2004.
2. F. R. Chung. Spectral Graph Theory. Regional Conference Series inMathematics. AmericanMathematical Society, Rhode Island, 1998.
3. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849-856, 2001.
4. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell, 22:888-905, 2000.
5. M. Szummer and T. Jaakkola. Partially labeled classification with Markov random walks. In NIPS 2001, 2002.
6. T. Zhang and R. K. Ando. Analysis of spectral kernel design based semi-supervised learning. In NIPS, 2006.
7. D. Zhou, O. Bousquet, T. Lal, J. Weston, and B. Schlkopf. Learning with local and global consistency. In NIPS 2003, pages 321-328, 2004.
8. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using Gaussian fields and harmonic functions. In ICML 2003, 2003.