On the limits of proper learnability of subclasses of DNF formulas

Machine Learning

Volumn 25, Issue 2-3, 1996, Pages 237-263

  Pillaipakkamnatt, Krishnan ^a   Raghavan, Vijay ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

Models of learning exact, PAC; Proper learning

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; KNOWLEDGE ACQUISITION; MATHEMATICAL MODELS; MEMBERSHIP FUNCTIONS;

DISJUNCTIVE NORMAL FORM FORMULAS; LEARNING EXACT MODELS; MEMBERSHIP QUERIES; PROPER LEARNING;

LEARNING SYSTEMS;

EID: 0030282125     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf00114011     Document Type: Article

References (3)

1. Angluin, D., Hellerstein, L. & Karpinski, M. (1993). Learning Read-Once Formulas with Queries. Journal of the ACM, pages 185-210.
2. Angluin, D. (1990). Negative Results for Equivalence Queries. Machine Learning, 5:121-150.
3. Pitt, L. & Valiant, L. (1988). Computational Limitations on Learning from Examples. Journal of the ACM, 35(4):965-984.