Sciweavers

4660 search results - page 445 / 932
» Learning from imperfect data
Sort
View
COLT
2006
Springer
15 years 11 months ago
Teaching Randomized Learners
Abstract. The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the infl...
Frank J. Balbach, Thomas Zeugmann
SIGIR
2008
ACM
15 years 7 months ago
Semi-supervised spam filtering: does it work?
The results of the 2006 ECML/PKDD Discovery Challenge suggest that semi-supervised learning methods work well for spam filtering when the source of available labeled examples diff...
Mona Mojdeh, Gordon V. Cormack
ALT
2009
Springer
16 years 4 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
16 years 8 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
ATAL
2005
Springer
16 years 1 months ago
Matchmaking multi-party interactions using historical performance data
Matchmaking will be an important component of future agent and agent-like systems, such as the semantic web. Most research on matchmaking has been directed toward sophisticated ma...
David Lambert, David Robertson