Searching for "Learning Quickly When Irrelevant Attributes Abound A New Linear-threshold Algorithm." – sorted by Relevance.
8 documents found, showing 1 through 8.
-
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
- … in The Netherlands Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm NICK…
- Cited by 507 (4 self) – Add To MetaCart
-
Relative Loss Bounds for Entropy Based Updates (Preliminary Bibliography)
- … attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285--318, 1988. [2] N. Littlestone…
- Add To MetaCart
-
Theory, 1998. [BB, p.90] A. Blum and C. Burch. On-line learning and the metrical task system. In
- … when irrelevant attributes abound: a new linear threshold algorithm. Machine Learning, 2:285-318, 1988…
- Add To MetaCart
-
List of Publications Related to the Thesis
- …. [Lit88] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold…
- Add To MetaCart
-
Leslie G. Valiant. A theory of the learnable. Communications of the ACM,
- …. Statistical Science, 5(1):44{89, 1990. Nick Littlestone. Learning quickly when irrelevant attributes abound: A…
- Add To MetaCart
-
[Tou89] David Touretsky.
- …(1):44--89, 1990. [Lit88] Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold…
- Add To MetaCart
-
Towards a More Comprehensive Theory of Learning in Computers
- … attributes abound: a new linear-threshold algorithm. Machine Learning, 2:285--318, 1988. [Littlestone, 1989a…
- Cited by 1 (1 self) – Add To MetaCart
-
Bibliography
- … Attributes Abound: A New Linear-Threshold Algorithm," Machine Learning 2: 285-318, 1988. [Maass & Tur…
- Add To MetaCart
Showing 1 through 8.
