Exact VC-dimension of Boolean monomials

DOI10.1016/0020-0190(96)00084-1zbMath1046.68636OpenAlexW2000780592MaRDI QIDQ1847362

Michael Schmitt, Thomas Nathschläger

Publication date: 24 June 2003

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

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00084-1

zbMATH Keywords

monotone monomials

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Neural Networks with Local Receptive Fields and Superlinear VC Dimension

Cites Work

• Unnamed Item
• A general lower bound on the number of examples needed for learning
• Probably Approximate Learning of Sets and Functions
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable

This page was built for publication: Exact VC-dimension of Boolean monomials