A note on learning DNF formulas using equivalence and incomplete membership queries

  • Zhixiang Chen
Selected Papers Algorithmic Learning Theory

DOI: 10.1007/3-540-58520-6_70

Part of the Lecture Notes in Computer Science book series (LNCS, volume 872)
Cite this paper as:
Chen Z. (1994) A note on learning DNF formulas using equivalence and incomplete membership queries. In: Arikawa S., Jantke K.P. (eds) Algorithmic Learning Theory. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 872. Springer, Berlin, Heidelberg

Abstract

In this note, we prove with derandomization techniques that a subclass of DNF formulas with nonconstant number of terms is polynomial time learnable using equivalence and incomplete membership queries. Although many concept classes are known to be polynomial time learnable using equivalence and membership queries, so far only two concept classes are known to be polynomial time learnable (see, [AS] and [GM]) when incomplete membership queries are used.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Zhixiang Chen
    • 1
  1. 1.Department of Computer ScienceBoston UniversityBoston

Personalised recommendations