Partial Occam's Razor and its applications

DOI10.1016/S0020-0190(97)00169-5zbMath0900.68354OpenAlexW1989925667MaRDI QIDQ1127393

Osamu Watanabe, Tatsuie Tsukiji, Carlos Domingo

Publication date: 13 August 1998

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00169-5

zbMATH Keywords

PAC learningBoolean formulasOccam's RazorPartially consistent hypothesis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Decision tree approximations of Boolean functions

Cites Work

• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Occam's razor
• On the necessity of Occam algorithms
• Learning Boolean concepts in the presence of many irrelevant features
• On weak learning
• Boosting a weak learning algorithm by majority
• A theory of the learnable
• Cryptographic limitations on learning Boolean formulae and finite automata
• Learning Boolean formulas
• Lower bounds on learning decision lists and trees
• Unnamed Item

This page was built for publication: Partial Occam's Razor and its applications