Abstract
AbstractWe consider the Boolean concept classes of 2-term DNF and 1-decision lists which both have a teaching dimension exponential in the number n of variables. It is shown that both classes have an average teaching dimension linear in n. We also consider learners that always choose a simplest consistent hypothesis instead of an arbitrary consistent one. Both classes can be taught to these learners by efficient teaching algorithms using only a linear number of examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
