Please use this identifier to cite or link to this item:

Kernel selection forl semi-supervised kernel machines

Authors Dai, G.
Yeung, D.-Y.
Issue Date 2007
Source ACM International Conference Proceeding Series , v. 227, 2007, p. 185-192
Summary Existing semi-supervised learning methods are mostly based on either the cluster assumption or the manifold assumption. In this paper, we propose an integrated regularization framework for semi-supervised kernel machines by incorporating both the cluster assumption and the manifold assumption. Moreover, it supports kernel learning in the form of kernel selection. The optimization problem involves joint optimization over all the labeled and unlabeled data points, a convex set of basic kernels, and a discrete space of unknown labels for the unlabeled data. When the manifold assumption is incorporated, graph Laplacian kernels are used as the basic kernels for learning an optimal convex combination of graph Laplacian kernels. Comparison with related methods on the USPS data set shows very promising results.
Rights © ACM, 2007. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM International Conference Proceeding Series, v. 227, p. 185-192.
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Scopus
Files in this item:
File Description Size Format
yeung.icml2007a1.pdf 196498 B Adobe PDF