A new abstract combinatorial dimension for exact learning via queries
type: Item
instance of: scholarly article
title: A new abstract combinatorial dimension for exact learning via queries
zbMATH Open document ID: 1006.68109
author: José L. Balcázar
author: David Guijarro
author: Jorge Castro
published in: Journal of Computer and System Sciences
publication date: 2002-07-04T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1763422
zbMATH Keywords: polynomial-query learning algorithms
MaRDI profile type: Publication
full work available at URL: jcss.2001.1794
OpenAlex ID: W2012548282
cites work: On the learnability of disjunctive normal form formulas
cites work: Queries and concept learning
cites work: The complexity of exactly learning algebraic concepts
cites work: Exact learning via teaching assistants
cites work: Q4955302
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Oracles and queries that are sufficient for exact learning
cites work: Learning nearly monotone \(k\)-term DNF
cites work: On the complexity of teaching
cites work: Exact learning when irrelevant variables abound
cites work: Q4013534
cites work: How many queries are needed to learn?
cites work: A framework for polynomial-time query learnability
DOI: 10.1006/JCSS.2001.1794
description: scientific article; zbMATH DE number 1763422