Learning 2μDNF Formulas and kμ Decision Trees

This publication has 8 references indexed in Scilit:

• When won't membership queries help?
  Published by Association for Computing Machinery (ACM) ,1991
• Boosting a weak learning algorithm by majority
  Published by Elsevier ,1990
• Identifying μ-Formula Decision Trees with Queries
  Published by Elsevier ,1990
• The strength of weak learnability
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Learning regular sets from queries and counterexamples
  Information and Computation, 1987
• On the learnability of Boolean formulae
  Published by Association for Computing Machinery (ACM) ,1987
• Induction of decision trees
  Machine Learning, 1986
• A theory of the learnable
  Communications of the ACM, 1984