Can PAC learning algorithms tolerate random attribute noise?
type: Item
instance of: scholarly article
title: Can PAC learning algorithms tolerate random attribute noise?
zbMATH Open document ID: 0837.68094
DOI: 10.1007/BF01300374
author: Sally A. Goldman
author: R. H. Sloan
published in: Algorithmica
publication date: 1996-04-16T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 778426
zbMATH Keywords: PAC learning algorithms
zbMATH Keywords: uniform attribute noise
MaRDI profile type: Publication
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Equivalence of models for polynomial learnability
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Learning in the Presence of Malicious Errors
cites work: Q4040311
cites work: A theory of the learnable
full work available at URL: https://doi.org/10.1007/bf01300374
OpenAlex ID: W2021885139
Recommended article: Q4955313
Recommended article: PAC learning with nasty noise.
Recommended article: PAC-learning in the presence of one-sided classification~noise
Recommended article: Uniform-distribution attribute noise learnability
Recommended article: Q3126569
Recommended article: PAC-learning with approximate predictors
Recommended article: Q3046710
Recommended article: Exploring learnability between exact and PAC
description: scientific article; zbMATH DE number 778426