Sciweavers

3114 search results - page 264 / 623
» Distributed Case-Based Learning
Sort
View
ICML
2006
IEEE
16 years 2 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
ICML
2002
IEEE
16 years 2 months ago
Learning Decision Trees Using the Area Under the ROC Curve
ROC analysis is increasingly being recognised as an important tool for evaluation and comparison of classifiers when the operating characteristics (i.e. class distribution and cos...
César Ferri, José Hernández-O...
ICML
1995
IEEE
16 years 2 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
16 years 2 months ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson
ICDAR
2009
IEEE
15 years 8 months ago
Statistical Modeling and Learning for Recognition-Based Handwritten Numeral String Segmentation
This paper proposes a recognition based approach to handwritten numeral string segmentation. We consider two classes: numeral strings segmented correctly or not. The feature vecto...
Yanjie Wang, Xiabi Liu, Yunde Jia