Graph-Based Semi-Supervised Learning and Spectral Kernel Design
Authors:
- Tong ZhangTZTong Zhang
- 4 January 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 54 (1) , 275-288
Abstract
In this paper, we consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised learning methods on graphs. We examine various theoretical properties of such methods. In particular, we present learning bounds and derive optimal kernel representation by minimizing the bound. Based on the theoretical analysis, we are able to demonstrate why spectral kernel design based methods can improve the predictive performance. Empirical examples are included to illustrate the main consequences of our analysis.Keywords
This publication has 5 references indexed in Scilit:
- Learning Bounds for Kernel Regression Using Effective Data DimensionalityNeural Computation, 2005
- Semi-Supervised Learning on Riemannian ManifoldsMachine Learning, 2004
- Leave-One-Out Bounds for Kernel MethodsNeural Computation, 2003
- Spline Models for Observational Data1990
- Convex Analysis1970