Sciweavers

32545 search results - page 6040 / 6509
» Data Structures and Algorithms
Sort
View
ICML
2006
IEEE
16 years 8 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
ICML
2006
IEEE
16 years 8 months ago
A choice model with infinitely many latent features
Elimination by aspects (EBA) is a probabilistic choice model describing how humans decide between several options. The options from which the choice is made are characterized by b...
Carl Edward Rasmussen, Dilan Görür, Fran...
ICML
2006
IEEE
16 years 8 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
16 years 8 months ago
Topic modeling: beyond bag-of-words
Some models of textual corpora employ text generation methods involving n-gram statistics, while others use latent topic variables inferred using the "bag-of-words" assu...
Hanna M. Wallach
ICML
2006
IEEE
16 years 8 months ago
Kernel Predictive Linear Gaussian models for nonlinear stochastic dynamical systems
The recent Predictive Linear Gaussian model (or PLG) improves upon traditional linear dynamical system models by using a predictive representation of state, which makes consistent...
David Wingate, Satinder P. Singh
« Prev « First page 6040 / 6509 Last » Next »