Sciweavers

4366 search results - page 81 / 874
» Learning and Smoothed Analysis
Sort
View
112
Voted
APAL
2006
98views more  APAL 2006»
15 years 3 months ago
Ackermann's substitution method (remixed)
We aim at a conceptually clear and technical smooth investigation of Ackermann's substitution method. Our analysis provides a direct classification of the provable recursive ...
Georg Moser
134
Voted
ICML
2010
IEEE
15 years 4 months ago
SVM Classifier Estimation from Group Probabilities
A learning problem that has only recently gained attention in the machine learning community is that of learning a classifier from group probabilities. It is a learning task that ...
Stefan Rüping
114
Voted
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
15 years 5 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan
146
Voted
IVC
2006
187views more  IVC 2006»
15 years 3 months ago
Dynamics of facial expression extracted automatically from video
We present a systematic comparison of machine learning methods applied to the problem of fully automatic recognition of facial expressions, including AdaBoost, support vector mach...
Gwen Littlewort, Marian Stewart Bartlett, Ian R. F...
156
Voted
ICML
2001
IEEE
16 years 4 months ago
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
Accurate, well-calibrated estimates of class membership probabilities are needed in many supervised learning applications, in particular when a cost-sensitive decision must be mad...
Bianca Zadrozny, Charles Elkan