Based on the uniform distribution PAC learning model, the learnability for the class of monotone disjunctive normal form formulas with at most O (log n) terms, denoted O (log n)-term MDNF, is investigated. Using the technique of restriction, an algorithm that learns O (log n)-term MDNF by examples in polynomial time is given.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics