A subexponential exact learning algorithm for DNF using equivalence queries
type: Item
instance of: scholarly article
title: A subexponential exact learning algorithm for DNF using equivalence queries
zbMATH Open document ID: 1046.68635
DOI: 10.1016/0020-0190(96)00077-4
author: Nader H. Bshouty
published in: Information Processing Letters
publication date: 2003-06-24T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1835240
zbMATH Keywords: PAC-learning algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00077-4
OpenAlex ID: W2020712580
cites work: Queries and concept learning
cites work: Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
cites work: A theory of the learnable
Recommended article: Q4470558
Recommended article: Exact learning of DNF formulas using DNF hypotheses
Recommended article: On the limits of proper learnability of subclasses of DNF formulas
Recommended article: Learnability of DNF with representation-specific queries
Recommended article: Fast learning of \(k\)-term DNF formulas with queries.
Recommended article: On Exact Learning Monotone DNF from Membership Queries
Recommended article: New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
Recommended article: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Recommended article: Proper learning of \(k\)-term DNF formulas from satisfying assignments
description: scientific article; zbMATH DE number 1835240