Sciweavers

ICML
2006
IEEE
14 years 5 months ago
Sequential update of ADtrees
Ingcreasingly, data-mining algorithms must deal with databases that continuously grow over time. These algorithms must avoid repeatedly scanning their databases. When database att...
Josep Roure, Andrew W. Moore
ICML
2006
IEEE
14 years 5 months ago
Combining discriminative features to infer complex trajectories
We propose a new model for the probabilistic estimation of continuous state variables from a sequence of observations, such as tracking the position of an object in video. This ma...
David A. Ross, Simon Osindero, Richard S. Zemel
ICML
2006
IEEE
14 years 5 months ago
An analytic solution to discrete Bayesian reinforcement learning
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
Pascal Poupart, Nikos A. Vlassis, Jesse Hoey, Kevi...
ICML
2006
IEEE
14 years 5 months ago
How boosting the margin can also boost classifier complexity
Boosting methods are known not to usually overfit training data even as the size of the generated classifiers becomes large. Schapire et al. attempted to explain this phenomenon i...
Lev Reyzin, Robert E. Schapire
ICML
2006
IEEE
14 years 5 months ago
The support vector decomposition machine
In machine learning problems with tens of thousands of features and only dozens or hundreds of independent training examples, dimensionality reduction is essential for good learni...
Francisco Pereira, Geoffrey J. Gordon
ICML
2006
IEEE
14 years 5 months ago
Reinforcement learning for optimized trade execution
We present the first large-scale empirical application of reinforcement learning to the important problem of optimized trade execution in modern financial markets. Our experiments...
Yuriy Nevmyvaka, Yi Feng, Michael S. Kearns
ICML
2006
IEEE
14 years 5 months ago
Learning hierarchical task networks by observation
Knowledge-based planning methods offer benefits over classical techniques, but they are time consuming and costly to construct. There has been research on learning plan knowledge ...
Negin Nejati, Pat Langley, Tolga Könik
ICML
2006
IEEE
14 years 5 months ago
Full Bayesian network classifiers
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
Jiang Su, Harry Zhang
ICML
2006
IEEE
14 years 5 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
ICML
2006
IEEE
14 years 5 months ago
Learning to impersonate
Consider Alice, who is interacting with Bob. Alice and Bob have some shared secret which helps Alice identify Bob-impersonators. Now consider Eve, who knows Alice and Bob, but doe...
Moni Naor, Guy N. Rothblum