Can PAC learning algorithms tolerate random attribute noise?
From MaRDI portal
Publication:1894713
DOI10.1007/BF01300374zbMath0837.68094MaRDI QIDQ1894713
Sally A. Goldman, Robert H. Sloan
Publication date: 16 April 1996
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01300374
68T05: Learning and adaptive systems in artificial intelligence
68W10: Parallel algorithms in computer science
Related Items
Four types of noise in data for PAC learning, Knowing what doesn't matter: exploiting the omission of irrelevant data, Learning with unreliable boundary queries, Learning fixed-dimension linear thresholds from fragmented data, Uniform-distribution attribute noise learnability, Incentive compatible regression learning, Learning juntas in the presence of noise, On the Evolution of Monotone Conjunctions: Drilling for Best Approximations
Cites Work