Who Cited It

Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

1988 · Machine Learning · 1,382 citations · 12 from inside this corpus

Nick Littlestone low

No abstract in the source record.

Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm (1988)Learning Quickly When Irrelev…Parallel Distributed Processing (1986)Parallel Distributed Processi…On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities (1971)On the Uniform Convergence of…Learnability and the Vapnik-Chervonenkis dimension (1989)Learnability and the Vapnik-C…Queries and Concept Learning (1988)Queries and Concept LearningGeneralization as search (1982)Generalization as searchNatural Language Processing (almost) from Scratch (2011)Natural Language Processing (…Natural Language Processing (almost) from Scratch (2011)Natural Language Processing (…A survey on concept drift adaptation (2014)A survey on concept drift ada…Selection of relevant features and examples in machine learning (1997)Selection of relevant feature…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Understanding Machine Learning: From Theory To Algorithms (2015)Understanding Machine Learnin…Irrelevant Features and the Subset Selection Problem (1994)Irrelevant Features and the S…Learnability and the Vapnik-Chervonenkis dimension (1989)Learnability and the Vapnik-C…Increased rates of convergence through learning rate adaptation (1988)Increased rates of convergenc…Queries and Concept Learning (1988)Queries and Concept LearningFeature selection, L 1 vs. L 2 regularization, and rotational invariance (2004)Feature selection, L 1 vs. L …What Size Net Gives Valid Generalization? (1989)What Size Net Gives Valid Gen…
17 of 17 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

What this paper cites, inside the corpus

PaperYearCited
Parallel Distributed Processing198615,411
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities19712,435
Learnability and the Vapnik-Chervonenkis dimension19891,855
Queries and Concept Learning19881,636
Generalization as search19821,442

What cites it, inside the corpus

PaperYearCited
Natural Language Processing (almost) from Scratch20115,174
Natural Language Processing (almost) from Scratch20113,991
A survey on concept drift adaptation20143,563
Selection of relevant features and examples in machine learning19973,309
Prediction, Learning, and Games20063,279
Understanding Machine Learning: From Theory To Algorithms20153,081
Irrelevant Features and the Subset Selection Problem19942,388
Learnability and the Vapnik-Chervonenkis dimension19891,855
Increased rates of convergence through learning rate adaptation19881,810
Queries and Concept Learning19881,636
Feature selection, L 1 vs. L 2 regularization, and rotational invariance20041,603
What Size Net Gives Valid Generalization?19891,559

Links

DOI · OpenAlex record

Topics

Machine Learning and AlgorithmsComputer Science
Algorithms and Data CompressionComputer Science
Machine Learning and Data ClassificationComputer Science

Is this record sound?

complete

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

  • supports1 author record(s) attached.
  • supports28 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:59+00:00.

sha256 59007f057c7dae86…