arXiv · math/0604233
Generalization error bounds in semi-supervised classification under the cluster assumption
Abstract
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumption relating the behavior of the regression function to that of the marginal distribution. Seeger (2000) proposed the well-known "cluster assumption" as a reasonable one. We propose a mathematical formulation of this assumption and a method based on density level sets estimation that takes advantage of it to achieve fast rates of convergence both in the number of unlabeled examples and the number of labeled examples.
Explore related subjects
Keep this discovery
Philippe Rigollet. 2006-04-11. Generalization error bounds in semi-supervised classification under the cluster assumption. https://arxiv.org/abs/math/0604233
Cite the original work for its findings. Save a collection to share your selection of sources.