Learning from positive and unlabeled examples

Theoretical Computer Science

Volumn 348, Issue 1, 2005, Pages 70-83

  Denis, François ^a   Gilleron, Rémi ^b   Letouzey, Fabien ^b  

^a AIX MARSEILLE UNIV   (France)

^b UNIV LILLE   (France)

Author keywords

Data mining; PAC learning; Semi supervised learning; Statistical query model

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA MINING; LEARNING ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; QUERY LANGUAGES; STATISTICAL METHODS;

PAC LEARNING; SEMI-SUPERVISED LEARNING; STATISTICAL QUERY MODELS;

LEARNING SYSTEMS;

EID: 27744465529     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.007     Document Type: Conference Paper

References (18)

1. D. Angluin, and P. Laird Learning from noisy examples Machine Learning 2 4 1988 343 370
2. A. Blum, A. Kalai, H. Wasserman, Noise-tolerant learning, the parity problem, and the statistical query model, in: Proc. 32nd Annu. ACM Symp. on Theory of Computing, 2000, pp. 435-440.
3. A. Blum, T. Mitchell, Combining labeled and unlabeled data with co-training, in: Proc. 11th Annu. Conf. on Computational Learning Theory, 1998, pp. 92-100.
4. L. Breiman, J.H. Friedman, R.A. Olshen, C.J. Stone, Classification and regression trees, Technical Report, Wadsworth International, Monterey, CA, 1984.
5. S.E. Decatur, Pac learning with constant-partition classification noise and applications to decision tree induction, in: Proc. 14th Internat. Conf. on Machine Learning, 1997, pp. 83-91.
6. F. DeComité, F. Denis, R. Gilleron, F. Letouzey, Positive and unlabeled examples help learning, in: Proc. 10th Internat. Conf. on Algorithmic Learning Theory, 1999, pp. 219-230.
7. F. Denis, PAC learning from positive statistical queries, in: Proc. 9th Internat. Conf. on Algorithmic Learning Theory, 1998, pp. 112-126.
8. S. Goldman, Y. Zhou, Enhancing supervised learning with unlabeled data, in: Proc. 17th Internat. Conf. on Machine Learning, 2000, pp. 327-334.
9. D. Haussler, M. Kearns, N. Littlestone, and M.K. Warmuth Equivalence of models for polynomial learnability Inform. Comput. 95 2 1991 129 161
10. J. Jackson, On the efficiency of noise-tolerant PAC algorithms derived from statistical queries, in: Proc. 13th Annu. Conf. on Computational Learning Theory, 2000, pp. 7-15.
11. T. Joachims, Transductive inference for text classification using support vector machines, in: Proc. 16th Internat. Conf. on Machine Learning, 1999, pp. 200-209.
12. M. Kearns, Efficient noise-tolerant learning from statistical queries, in: Proc. 25th ACM Symp. on the Theory of Computing, 1993, pp. 392-401.
13. C.J. Merz, P.M. Murphy, UCI repository of machine learning databases, 1998.
14. T. Mitchell Machine learning and data mining Commun. ACM 42 11 1999 30 36
15. K. Nigam, R. Ghani, Analyzing the applicability and effectiveness of co-training, in: Proc. 9th Internat. Conf. on Information and Knowledge Management, 2000, pp. 86-93.
16. K. Nigam, A.K. McCallum, S. Thrun, and T.M. Mitchell Text classification from labeled and unlabeled documents using EM Machine Learning 39 2/3 2000 103 134
17. J.R. Quinlan C4.5: Programs for Machine Learning 1993 Morgan Kaufmann Los Altos, CA
18. L.G. Valiant A theory of the learnable Commun. ACM 27 11 1984 1134 1142