Generalization error bounds in semi-supervised classification under the cluster assumption

Details Generalization error bounds in semi-supervised classification under the cluster assumption Generalization error bounds in semi-supervised classification under the cluster assumption

2006-04-11

arxiv.org/abs/math/0604233v1

Mathematics

Statistics Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Generalization error bounds in semi-supervised classification under the cluster assumption does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalization error bounds in semi-supervised classification under the cluster assumption, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalization error bounds in semi-supervised classification under the cluster assumption will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286475