Sciweavers

266 search results - page 21 / 54
» Learning to Identify Unexpected Instances in the Test Set
Sort
View
ICML
2009
IEEE
14 years 8 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
AAAI
1996
13 years 8 months ago
Bagging, Boosting, and C4.5
Breiman's bagging and Freund and Schapire's boosting are recent methods for improving the predictive power of classi er learning systems. Both form a set of classi ers t...
J. Ross Quinlan
ITS
2004
Springer
123views Multimedia» more  ITS 2004»
14 years 22 days ago
Combining Heuristics and Formal Methods in a Tool for Supporting Simulation-Based Discovery Learning
Abstract. This paper describes the design of a tool to support learners in simulation-based discovery learning environments. The design redesigns and extents a previous tool to ove...
Koen Veermans, Wouter R. van Joolingen
KES
2006
Springer
13 years 7 months ago
The Repository Method for Chance Discovery in Financial Forecasting
Abstract. The aim of this work is to forecast future events in financial data sets, in particular, we focus our attention on situations where positive instances are rare, which fal...
Alma Lilia Garcia-Almanza, Edward P. K. Tsang
CVPR
2003
IEEE
14 years 9 months ago
Recognizing Objects in Adversarial Clutter: Breaking a Visual CAPTCHA
In this paper we explore object recognition in clutter. We test our object recognition techniques on Gimpy and EZGimpy, examples of visual CAPTCHAs. A CAPTCHA ("Completely Au...
Greg Mori, Jitendra Malik