The monotone theory for the PAC-model.

DOI10.1016/S0890-5401(03)00116-0zbMath1058.68064OpenAlexW2087745889MaRDI QIDQ1426003

Nader H. Bshouty

Publication date: 14 March 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00116-0

zbMATH Keywords

decision treesCNF representations

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Unnamed Item
• Matching is as easy as matrix inversion
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• Boosting a weak learning algorithm by majority
• Queries and concept learning
• Exact learning Boolean functions via the monotone theory
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Learning Decision Trees Using the Fourier Spectrum

This page was built for publication: The monotone theory for the PAC-model.