Partial Occam's Razor and its applications

DOI10.1016/S0020-0190(97)00169-5zbMATH Open0900.68354OpenAlexW1989925667MaRDI QIDQ1127393FDOQ1127393

Authors: Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe 

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)

Cites Work

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

Cited In (1)

• Decision tree approximations of Boolean functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127393)