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

Journal of Machine Learning Research

Volumn 8, Issue , 2007, Pages 1369-1392

  Rigollet, Philippe ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Classification; Cluster assumption; Generalization bounds; Semi supervised learning; Statistical learning theory

Indexed keywords

CLASSIFICATION (OF INFORMATION); ERROR ANALYSIS; REGRESSION ANALYSIS; SET THEORY;

CLUSTER ASSUMPTION; SEMI-SUPERVISED LEARNING; STATISTICAL LEARNING THEORY;

SUPERVISED LEARNING;

EID: 34547675831     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (34)

1. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. Optics: Ordering points to identify the clustering structure. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 49-60, 1999.
2. J.-Y. Audibert and A. Tsybakov. Fast learning rates for plug-in classifiers. Ann. Statist., 34(2), 2007.
3. M.-F. Balean and A. Blum. A pac-style model for learning from labeled and unlabeled data. In Proceedings of the Eighteenth Annual Conference on Learning Theory, pages 111-126, 2005.
4. M. Belkin and P. Niyogi. Semi-supervised learning on Riemannian manifolds. Mach. Learn., 56 (1-3):209-239, 2004.
5. A. Blum and T. M. Mitchell. Combining labeled and unlabeled sata with co-training. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, pages 92-100, 1998.
6. S. Boucheron, O. Bousquet, and G. Lugosi. Theory of classification: a survey of some recent advances. ESAIM Probab. Stat., 9:323-375 (electronic), 2005.
7. O. Bousquet, O. Chapelle, and M. Hein. Measure based regularization. In Advances in Neural Information Processing Systems, volume 16, 2004.
8. V. Castelli and T. M. Cover. On the exponential value of labeled samples. Pattern Recogn. Lett., 16 (1):105-111, 1995.
9. V. Castelli and T. M. Cover. The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter. IEEE Trans. Inform. Theory, 42(6, part 2):2102-2117, 1996.
10. O. Chapelle, B. Schlkopf, and A. Zien. Semi-Supervised Learning. MIT Press, Cambridge, Massachusetts, 2006.
11. O. Chapelle and A. Zien. Semi-supervised classification by low density separation. In Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, pages 57-64, 2005.
12. A. Cuevas, M. Febrero, and R. Fraiman. Cluster analysis: a further approach based on density estimation. Comput. Statist. Data Anal., 36(4):441-459, 2001.
13. A. Cuevas and R. Fraiman. A plug-in approach to support estimation. Ann. Statist., 25(6):2300-2312, 1997.
14. F. d'Alché Buc, Y. Grandvalet, and C. Ambroise. Semi-supervised marginboost. In Advances in Neural Information Processing Systems, volume 14, pages 553-560, 2001.
15. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, New York, 1996.
16. D. S. Dummit and R. M. Foote. Abstract Algebra. Prentice Hall Inc., Englewood Cliffs, New Jersey, 1991.
17. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, pages 226-231, 1996.
18. J. H. Hartigan. Clustering Algorithms. John Wiley & Sons, Inc., New York, 1975.
19. R. Herbei and M. Wegkamp. Classification with rejection option. Canad. J. Statist., 34(4):709-721, 2006.
20. T. Hertz, A. Bar-Hillel, and D. Weinshall. Boosting margin based distance functions for clustering. In Proceedings of the Twenty-First International Conference on Machine learning, 2004.
21. E. Mammen and A. B. Tsybakov. Smooth discrimination analysis. Ann. Statist., 27(6): 1808-1829, 1999.
22. W. Polonik. Measuring mass concentrations and estimating density contour clusters-an excess mass approach. Ann. Statist., 23(3):855-881, 1995.
23. M. Rattray. A model-based distance for clustering. In Proc. of the IEEE-INNS-ENNS Int. Joint Conf. on Neural Networks, pages 13-16, 2000.
24. P. Rigollet and R. Vert. Fast rates for plug-in estimators of density level sets. Technical Report 1102, Laboratoire de Probabilités et Modèles Aléatoires de Paris 6, 2006. URL http://hal.ccsd.cnrs.fr/ ccsd-00114180.
25. M. Seeger. Learning with labeled and unlabeled data. Technical report, Institute for ANC, Edinburgh, UK, 2000. URL http://www.dai.ed.ac.uk/~seeger/ papers.html.
26. I. Steinwart, D. Hush, and C. Scovel. A classification framework for anomaly detection. J. Mach. Learn. Res., 6:211-232, 2005.
27. W. Stuetzle. Estimating the cluster type of a density by analyzing the minimal spanning tree of a sample. J. Classification, 20(1):25-47, 2003.
28. M. Tipping. Deriving cluster analytic distance functions from Gaussian mixture models. In Proceedings of the Ninth International Conference on Neural Networks, pages 815-820, 1999.
29. A. B. Tsybakov. On nonparametric estimation of density level sets. Ann. Statist., 25(3):948-969, 1997.
30. A. B. Tsybakov. Optimal aggregation of classifiers in statistical learning. Ann. Statist., 32(1): 135-166, 2004.
31. S. A. van de Geer. Applications of Empirical Process Theory. Cambridge University Press, Cambridge, 2000.
32. V. N. Vapnik. Statistical Learning Theory. Wiley, New-York, 1998.
33. T. Zhang and F. J. Oles. A probability analysis on the value of unlabeled data for classification problems. In Proceedings of the Seventeenth International Conference on Machine Learning, 2000.
34. X. Zhu. Semi-supervised learning literature survey. Technical Report 1530, Computer Sciences, University of Wisconsin-Madison, 2005. URL http://www.cs.wisc.edu/~jerryzhu/pub/ssl_survey.pdf.