Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes (1995)
by
Avrim Blum
,
Nick Littlestone
,
Lisa Hellerstein
,
Lisa Hellerstein
| Citations: | 46 - 8 self |
BibTeX
@MISC{Blum95learningin,
author = {Avrim Blum and Nick Littlestone and Lisa Hellerstein and Lisa Hellerstein},
title = {Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper addresses the problem of learning boolean functions in query and mistake-bound
Citations
| 605 | Learning quickly when irrelevant attributes abound: A new linear threshold algorithm - Littlestone - 1988 |
| 583 | Queries and concept learning - Angluin - 1988 |
| 565 | Learnability and the Vapnik Chervonenkis dimension - Blumer, Ehrenfeucht, et al. - 1989 |
| 98 | Learning read-once formulas with queries - Angluin, Hellerstein, et al. - 1993 |
| 71 | Learning boolean functions in an infinite attribute space - Blum - 1992 |
| 41 | On the necessity of Occam algorithms - Board, Pitt - 1992 |
| 17 | On the complexity of learning from counterexamples and membership queries - Maass, Turfin - 1990 |
| 12 | Space efficient learning algorithms - Haussler - 1988 |
| 3 | Identifying -decision trees and -formulas with constrained instance queries - Hancock - 1989 |
