Queries and Concept Learning

Dana Angluin

doi:https://doi.org/10.1023/a:1022821128753

Queries and Concept Learning

1988 · Machine Learning · 1,636 citations · 6 from inside this corpus

No abstract in the source record.

9 of 9 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

Citation edge evidence

Each row is directed from the citing work to the cited work. Source status remains readable without the interactive graph.

Active Learning Literature Survey→Queries and Concept LearningLegacy edge — source detail unavailable
The Strength of Weak Learnability→Queries and Concept LearningLegacy edge — source detail unavailable
Learnability and the Vapnik-Chervonenkis dimension→Queries and Concept LearningLegacy edge — source detail unavailable
A sequential algorithm for training text classifiers→Queries and Concept LearningLegacy edge — source detail unavailable
Learning in the Presence of Concept Drift and Hidden Contexts→Queries and Concept LearningLegacy edge — source detail unavailable
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm→Queries and Concept LearningLegacy edge — source detail unavailable
Queries and Concept Learning→Learning regular sets from queries and counterexamplesLegacy edge — source detail unavailable
Queries and Concept Learning→Learnability and the Vapnik-Chervonenkis dimensionLegacy edge — source detail unavailable
Queries and Concept Learning→Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold AlgorithmLegacy edge — source detail unavailable
Learning in the Presence of Concept Drift and Hidden Contexts→Learnability and the Vapnik-Chervonenkis dimensionLegacy edge — source detail unavailable
The Strength of Weak Learnability→Learnability and the Vapnik-Chervonenkis dimensionLegacy edge — source detail unavailable
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm→Learnability and the Vapnik-Chervonenkis dimensionLegacy edge — source detail unavailable
Learnability and the Vapnik-Chervonenkis dimension→Learning regular sets from queries and counterexamplesLegacy edge — source detail unavailable
Learnability and the Vapnik-Chervonenkis dimension→Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold AlgorithmLegacy edge — source detail unavailable
Active Learning Literature Survey→A sequential algorithm for training text classifiersLegacy edge — source detail unavailable

What this paper cites, inside the corpus

Paper	Year	Cited
Learning regular sets from queries and counterexamples	1987	2,135
Learnability and the Vapnik-Chervonenkis dimension	1989	1,855
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm	1988	1,382

What cites it, inside the corpus

Paper	Year	Cited
Active Learning Literature Survey	2009	4,788
The Strength of Weak Learnability	1990	3,344
Learnability and the Vapnik-Chervonenkis dimension	1989	1,855
A sequential algorithm for training text classifiers	1994	1,806
Learning in the Presence of Concept Drift and Hidden Contexts	1996	1,445
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm	1988	1,382

Links

Download BibTeX · Download RIS · DOI · Open access copy · OpenAlex record

Topics

Machine Learning and Algorithms	Computer Science
Algorithms and Data Compression	Computer Science
semigroups and automata theory	Computer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports1 author record(s) attached.
supports31 reference(s) recorded.
neutralThe DOI carries no year to check against.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:56+00:00.

sha256 7bc26169e93749d1…