Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received February 2, 1998, and in revised form April 8, 1999, and in final form June 30, 1999.
Rights and permissions
About this article
Cite this article
Sakai, Y., Maruoka, A. Learning Monotone Log-Term DNF Formulas under the Uniform Distribution. Theory Comput. Systems 33, 17–33 (2000). https://doi.org/10.1007/s002249910002
Issue Date:
DOI: https://doi.org/10.1007/s002249910002