Sciweavers

615 search results - page 82 / 123
» fast 2003
Sort
View
ICML
2003
IEEE
15 years 10 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
ICML
2003
IEEE
15 years 10 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
15 years 10 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...
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
15 years 10 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
15 years 10 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...