Sciweavers

2208 search results - page 118 / 442
» Privacy-Preserving Classifier Learning
Sort
View
107
Voted
ICML
2006
IEEE
16 years 4 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
VMV
2008
107views Visualization» more  VMV 2008»
15 years 4 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler
138
Voted
COLT
1998
Springer
15 years 7 months ago
Large Margin Classification Using the Perceptron Algorithm
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
Yoav Freund, Robert E. Schapire
ICMLA
2010
15 years 1 months ago
An All-at-once Unimodal SVM Approach for Ordinal Classification
Abstract--Support vector machines (SVMs) were initially proposed to solve problems with two classes. Despite the myriad of schemes for multiclassification with SVMs proposed since ...
Joaquim F. Pinto da Costa, Ricardo Sousa, Jaime S....
ICML
2007
IEEE
16 years 4 months ago
Discriminative learning for differing training and test distributions
We address classification problems for which the training instances are governed by a distribution that is allowed to differ arbitrarily from the test distribution--problems also ...
Michael Brückner, Steffen Bickel, Tobias Sche...