Noise-tolerant Occam algorithms and their applications to learning decision trees

DOI10.1023/A:1022679002094zbMath0770.68100OpenAlexW2128406106MaRDI QIDQ2366679

Yasubumi Sakakibara

Publication date: 18 August 1993

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022679002094

zbMATH Keywords

decision treesdecision listslearning from examplesprobably approximately correct learningpolynomial-time learnabilitynoisy examples

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Noise modelling and evaluating learning from examples, Robust supervised classification with mixture models: learning from data with uncertain labels, Classification in the presence of class noise using a probabilistic kernel Fisher method, Learning with restricted focus of attention