Sciweavers

24 search results - page 4 / 5
» A Query Algorithm for Agnostically Learning DNF
Sort
View
ALT
1998
Springer
13 years 10 months ago
PAC Learning from Positive Statistical Queries
Learning from positive examples occurs very frequently in natural learning. The PAC learning model of Valiant takes many features of natural learning into account, but in most case...
François Denis
COLT
1995
Springer
13 years 9 months ago
Learning with Unreliable Boundary Queries
We introduce a new model for learning with membership queries in which queries near the boundary of a target concept may receive incorrect or “don’t care” responses. In part...
Avrim Blum, Prasad Chalasani, Sally A. Goldman, Do...
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
13 years 11 months ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
COLT
1992
Springer
13 years 10 months ago
Learning Switching Concepts
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
Avrim Blum, Prasad Chalasani
WWW
2010
ACM
13 years 6 months ago
Classification-enhanced ranking
Many have speculated that classifying web pages can improve a search engine's ranking of results. Intuitively results should be more relevant when they match the class of a q...
Paul N. Bennett, Krysta Marie Svore, Susan T. Duma...