Graph based semi-supervised learning with sharper edges

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4212 LNAI, Issue , 2006, Pages 401-412

  Shin, Hyunjung ^a,b   Jeremy Hill, N ^c   Rätsch, Gunnar ^a  

^a FRIEDRICH MIESCHER LABORATORY OF THE MAX PLANCK SOCIETY   (Germany)

^b Ajou University   (South Korea)

^c MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; GRAPH THEORY; LEARNING ALGORITHMS; OPTIMIZATION;

OPTIMIZATION CRITERION; SEMI-SUPERVISED LEARNING ALGORITHMS;

LEARNING SYSTEMS;

EID: 33750295407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871842_39     Document Type: Conference Paper

References (24)

1. F.R. Bach and M.I. Jordan. Learning spectral clustering. NIPS 16, 2004.
2. M. Belkin, I. Matveeva, and P. Niyogi. Regularization and regression on large graphs. Lecture Notes in Computer Science (In COLT), pages 624-638, 2004.
3. M. Belkin and P. Niyogi. Using manifold structure for partially labelled classification. NIPS 15, 2003.
4. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
5. O. Chapelle, B. Schölkopf, and A. Zien. Semi-Supervised Learning. MIT Press, Cambridge, MA (in press), 2006.
6. O. Chapelle, J. Weston, and B. Schölkopf. Cluster kernels for semi-supervised learning. NIPS 15, 2003.
7. F.R.K. Chung. Spectral Graph Theory. Number 92 in Regional Conference Series in Mathematics. American Mathematical Society, Providence, RI, 1997.
8. K. Crammer, J. Keshet, and Y. Singer. Kernel design using boosting. NIPS 15, 2003.
9. N. Cristianini, J. Shawe-Taylor, and J. Kandola. On kernel target alignment. NIPS 14, 2002.
10. T. De Bie and N. Cristianini. Convex method for transduction. NIPS 16, 2004.
11. J. Demsǎr. Statistical comparisons of claissifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, 2006.
12. P. Doyle and J. Snell. Random walks and electric networks. Mathematical Association of America, 1984.
13. T. Joachims. Transductive inference for text classification using support vector machines. In Proc. ICML, 1999.
14. I. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete structures. In Proc. ICML, 2002.
15. G.R.G. Lanckriet, N. Cristianini, L.E. Ghaoui, P. Bartlett, and M.I. Jordan. Learning the kernel matrix with semi-definite programming. In Proc. ICML, 2002.
16. B. Schölkopf and A. J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
17. V. Sindhwani, P. Niyogi, and M. Belkin. Beyond the point cloud: from transductive to semi-supervised learning. In Proc. ICML, 2005.
18. S. Sonnenburg, G. Rätsch, S. Schäfer, and B. Schölkopf. Large scale multiple kernel learning. Journal of Machine Learning Research, 2006. accepted.
19. D.A. Spielman and S.H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proc. of the 26th annual ACM symposium on Theory of computing, pages 81-90. ACM Press, 2004.
20. K. Tsuda, G. Rätsch, and M.K. Warmuth. Matrix exponentiated gradient updates for on-line learning and bregman projection. Journal of Machine Learning Research, 6:995-1018, 2005.
21. V. N. Vapnik. Statistical Learning Theory. Wiley-Interscience, 1998.
22. Z. Zhang, D.Y. Yeung, and J.T. Kwok. Bayesian inference for transductive learning of kernel matrix using the tanner-wong data augmentation algorithm. In Proc. ICML, 2004.
23. D. Zhou, O. Bousquet, J. Weston, and B. Schölkopf. Learning with local and global consistency. NIPS 16, 2004.
24. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In Proc. ICML, 2003.