On learning from queries and counterexamples in the presence of noise
type: Item
instance of: scholarly article
title: On learning from queries and counterexamples in the presence of noise
zbMATH Open document ID: 0714.68062
DOI: 10.1016/0020-0190(91)90220-C
author: Y. Sakakibara
published in: Information Processing Letters
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4176474
zbMATH Keywords: concept learning
zbMATH Keywords: formal languages
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: noise
zbMATH Keywords: random sampling
MaRDI profile type: Publication
Wikidata QID: Q124989026
cites work: Learning regular sets from queries and counterexamples
cites work: Q4013533
cites work: Learning context-free grammars from structural data in polynomial time
cites work: A theory of the learnable
full work available at URL: 0020-0190(91)90220-c
OpenAlex ID: W2083117818
Recommended article: Learning with queries corrupted by classification noise
Recommended article: Q4013555
Recommended article: Noise-tolerant learning, the parity problem, and the statistical query model
Recommended article: Efficient noise-tolerant learning from statistical queries
Recommended article: Learning via finitely many queries
Recommended article: Learning via queries in [+, <]
Recommended article: Learning via queries and oracles
Recommended article: Q4038688
description: scientific article; zbMATH DE number 4176474