Can PAC learning algorithms tolerate random attribute noise?
- 1 July 1995
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 14 (1) , 70-84
- https://doi.org/10.1007/bf01300374
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Learning in the Presence of Malicious ErrorsSIAM Journal on Computing, 1993
- Equivalence of models for polynomial learnabilityInformation and Computation, 1991
- Redundant Noisy Attributes, Attribute Errors, and Linear-threshold Learning Using WinnowPublished by Elsevier ,1991
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Learning from Good and Bad DataPublished by Springer Nature ,1988
- A theory of the learnableCommunications of the ACM, 1984
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963