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

Machine Learning

Volumn 2, Issue 4, 1988, Pages 285-318

  Littlestone, Nick ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

incremental learning; learning Boolean functions; Learning from examples; linear threshold algorithms; mistake bounds; prediction

Indexed keywords

EID: 34250091945     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1023/A:1022869011914     Document Type: Article

References (22)

1. Queries and concept learning
2. Inductive inference: Theory and methods
3. The logic of learning: A basis for pattern recognition and for improvement of performance
4. On the prediction of general recursive functions
5. Learnability and the Vapnik-Chervonenkis dimension
6. Occam's Razor
7. Linear function neurons: Structure and training
8. Quantifying the inductive bias in concept learning
9. On the learnability of Boolean formulae
10. Recent results on Boolean concept learning
11. Generalization as search
12. The programmer's guide to the Connection Machine
13. A theory of the learnable
14. Learning disjunctions of conjunctions
15. On the uniform convergence of relative frequencies of events to their probabilities