The value of labeled and unlabeled examples when the model is imperfect

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Sinha, Kaushik ^a   Belkin, Mikahil ^a  

^a Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; MIXTURES; SUPERVISED LEARNING;

LABELED AND UNLABELED DATA; MACHINE LEARNING LITERATURE; MIXTURE DISTRIBUTIONS; MIXTURE MODELING; NONPARAMETRICS; PURE COMPONENTS; SEMI-SUPERVISED LEARNING; SIMPLE++; THEORETICAL FOUNDATIONS; UNLABELED DATA;

PROBABILITY DISTRIBUTIONS;

EID: 85162044771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. J. Y. Audibert and A. Tsybakov. Fast convergence rate for plug-in estimators under margin conditions. In Unpublished manuscript, 2005.
2. M-F. Balcan and A. Blum. A PAC-style model for learning from labeled and unlabeled data. In 18th Annual Conference on Learning Theory, 2005.
3. M. Belkin and P. Niyogi. Semi-supervised learning on Riemannian manifolds. Machine Learning, 56, Invited, Special Issue on Clustering:209-239, 2004.
4. A. Blum and T. Mitchell. Combining labeled and unlabeled data with co-training. In 11th Annual Conference on Learning Theory, 1998.
5. V. Castelli and T. M. Cover. The relative values of labeled and unlabeld samples in pattern recognition with an unknown mixing parameters. IEEE Trans. Information Theory, 42((6):2102-2117, 1996. (Pubitemid 126771539)
6. O. Chapelle, J.Weston, and B. Scholkopf. Cluster kernels for semi-supervised learning. NIPS, 15, 2002.
7. O. Chapelle and A. Zien. Semi-supervised classification by low density separation. In 10th International Workshop on Artificial Intelligence and Statistics, 2005.
8. S. Dasgupta, M. L. Littman, and D. McAllester. PAC generalization bounds for co-training. NIPS, 14, 2001.
9. L. Devroye, L. Gyorfi, and G. Lugosi. A probabilistic theory of pattern recognition. Springer, New York, Berlin, Heidelberg, 1996.
10. J. Ratsaby. The complexity of learning from a mixture of labeled and unlabeled examples. In Phd Thesis, 1994.
11. J. Ratsaby and S. S. Venkatesh. Learning from a mixture of labeled and unlabeled examples with parametric side information. In 8th Annual Conference on Learning Theory, 1995.
12. A. B. Tsybakov. Optimal aggregation of classifiers in statistical learning. Ann. Statist., 32(1):135-166, 1996.
13. V. N. Vapnik. Statistical Learning Theory. Wiley, New York, 1998.
14. Y. Yang. Minimax nonparametric classification- part I: Rates of convergence, part II: Model selection for adaptation. IEEE Trans. Inf. Theory, 45:2271-2292, 1999.
15. X. Zhu. Semi-supervised literature survey. Technical Report 1530, Department of Computer Science, University of Wisconsin Madison, December 2006.