Sciweavers

7351 search results - page 992 / 1471
» Machine Learning
Sort
View
154
Voted
ICML
2003
IEEE
16 years 8 months ago
Adaptive Overrelaxed Bound Optimization Methods
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
Ruslan Salakhutdinov, Sam T. Roweis
ICML
2003
IEEE
16 years 8 months ago
Text Bundling: Statistics Based Data-Reduction
As text corpora become larger, tradeoffs between speed and accuracy become critical: slow but accurate methods may not complete in a practical amount of time. In order to make the...
Lawrence Shih, Jason D. Rennie, Yu-Han Chang, Davi...
ICML
2003
IEEE
16 years 8 months ago
SimpleSVM
We present a fast iterative support vector training algorithm for a large variety of different formulations. It works by incrementally changing a candidate support vector set usin...
S. V. N. Vishwanathan, Alex J. Smola, M. Narasimha...
ICML
2003
IEEE
16 years 8 months ago
Optimizing Classifier Performance via an Approximation to the Wilcoxon-Mann-Whitney Statistic
When the goal is to achieve the best correct classification rate, cross entropy and mean squared error are typical cost functions used to optimize classifier performance. However,...
Lian Yan, Robert H. Dodier, Michael Mozer, Richard...
ICML
2003
IEEE
16 years 8 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich