Queries revisited.
type: Item
instance of: scholarly article
title: Queries revisited.
zbMATH Open document ID: 1069.68086
author: Dana Angluin
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 2056566
zbMATH Keywords: Learning with queries
zbMATH Keywords: Query complexity
zbMATH Keywords: Learning dimension
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.11.004
OpenAlex ID: W2913371065
cites work: Queries and concept learning
cites work: Decision Trees for Geometric Models
cites work: Q3148815
cites work: A new abstract combinatorial dimension for exact learning via queries
cites work: The consistency dimension and distribution-dependent learning from queries.
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: A general lower bound on the number of examples needed for learning
cites work: On the complexity of teaching
cites work: Uniform characterizations of polynomial-query learnabilities
cites work: How many queries are needed to learn?
cites work: Constructing optimal binary decision trees is NP-complete
cites work: Lower bound methods and separation results for on-line learning models
cites work: Teachability in computational learning
cites work: A theory of the learnable
DOI: 10.1016/J.TCS.2003.11.004
description: scientific article; zbMATH DE number 2056566