Graph-based semi-supervised learning and spectral kernel design

IEEE Transactions on Information Theory

Volumn 54, Issue 1, 2008, Pages 275-288

  Johnson, Rie ^a   Zhang, Tong ^b  

^a RJ Research Consulting   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Graph based semi supervised learning; Kernel design; Transductive learning

Indexed keywords

GRAPH THEORY; OPTIMIZATION; SPECTRUM ANALYSIS;

GRAPH-BASED SEMI-SUPERVISED LEARNING; SPECTRAL DECOMPOSITION; TRANSDUCTIVE LEARNING;

SUPERVISED LEARNING;

EID: 38349114023     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.911294     Document Type: Article

References (20)

1. Y. Altun, M. Belkin, and D. McAllester, "Maximum margin semi-supervised learning for structured variables," in Advances in Neural Information Processing Systems 18. Cambridge, MA: MIT Press, 2006, pp. 33-40.
2. M. Belkin and P. Niyogi, "Semi-supervised learning on Riemannian manifolds," Mach. Learn., pp. 209-239, 2004, Special Issue on Clustering.
3. M. Belkin and P. Niyogi, "Toward a theoretical foundation for Laplacian-based manifold methods," in Proc. COLT'05, 2005, pp. 486-500.
4. M. Belkin, P. Niyogi, and V. Sindhwani, Manifold Regularization: A Geometric Framework for Learning From Examples, Univ. Chicago, Tech. Rep. TR-2004-06, 2004, Computer Science.
5. O. Chapelle, J. Weston, and B. Schölkopf, "Cluster kernels for semi-supervised learning," in Advances in Neural Information Processing Systems 15. Cambridge, MA: MIT Press, 2003, pp. 585-592.
6. E. Gine and V. Koltchinskii, "Empirical graph Laplacian approximation of Laplace-Beltrami operators: Large sample results," in Proc. 4th Int. Conf. High Dimensional Prob., 2005, pp. 238-259.
7. M. Hein, "Uniform convergence of adaptive graph-based regularization," in Proc. COLT'06, 2006, pp. 50-64.
8. M. Hein, J.-Y. Audibert, and U. von Luxburg, "From graphs to manifolds - Weak and strong pointwise consistency of graph Laplacians," in Proc. COLT'05, 2005, pp. 470-485.
9. G. Lanckriet, N. Cristianini, L. Ghaoui, P. Bartlett, and M. Jordan, "Learning the kernel matrix with semidefinite programming," J. Mach. Learn. Res., vol. 5, pp. 27-72, 2004.
10. D. J. C. MacKay, "Introduction to Gaussian processes," in Neural Netw. Machine Learning, ser. NATO ASI, C. M. Bishop, Ed. New York: Kluwer, 1998, pp. 133-166.
11. A. Y. Ng, M. I. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in Advances in Neural Information Processing Systems 13. Cambridge, MA: MIT Press, 2001, pp. 849-856.
12. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
13. M. Szummer and T. Jaakkola, "Partially labeled classification with Markov random walks," in Advances in Neural Information Processing Systems 14. Cambridge, MA: MIT Press, 2002, pp. 945-952.
14. G. Wahba, Spline Models for Observational Data, ser. CBMS-NSF Regional Conference Series in Applied Mathematics. Philadelphia, PA: SIAM, 1990.
15. T. Zhang, "Leave-one-out bounds for kernel methods," Neural Comput. vol. 15, pp. 1397-1437, 2003.
16. T. Zhang, "Learning bounds for kernel regression using effective data dimensionality," Neural Comput., vol. 17, pp. 2077-2098, 2005.
17. D. Zhou, O. Bousquet, T. Lal, J. Weston, and B. Schölkopf, "Learning with local and global consistency," in Advances in Neural Information Processing Systems 16. Cambridge, MA: MIT Press, 2004, pp. 321-328.
18. X. Zhu, Z. Ghahramani, and J. Lafferty, "Semi-supervised learning using Gaussian fields and harmonic functions," in Proc. ICML 2003, 2003, pp. 912-919.
19. X. Zhu, J. Kandola, Z. Ghahramani, and J. Lafferty, "Nonparametric transforms of graph kernels for semi-supervised learning," in Advances in Neural Information Processing Systems 17. Cambridge, MA: MIT Press, 2005, pp. 1641-1648.
20. X. Zhu, J. Lafferty, and Z. Ghahramani, "Semi-Supervised Learning: From Gaussian Fields to Gaussian Processes," CMU Tech. Rep. CMU-CS-03-175, 2003.