A PAC-Style Model for Learning from Labeled and Unlabeled Data
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 111-126
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Co-trained support vector machines for large scale unstructured document classification using unlabeled data and syntactic informationInformation Processing & Management, 2004
- A sharp concentration inequality with applicationsRandom Structures & Algorithms, 2000
- Text Classification from Labeled and Unlabeled Documents using EMMachine Learning, 2000
- A Polynomial-Time Algorithm for Learning Noisy Linear Threshold FunctionsAlgorithmica, 1998
- Combining labeled and unlabeled data with co-training1998
- The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameterIEEE Transactions on Information Theory, 1996
- A Probabilistic Theory of Pattern Recognition1996
- On the exponential value of labeled samplesPattern Recognition Letters, 1995
- Learnability with respect to fixed distributionsTheoretical Computer Science, 1991
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989