Sciweavers

745 search results - page 42 / 149
» A Preference Model for Structured Supervised Learning Tasks
Sort
View
79
Voted
ML
2002
ACM
100views Machine Learning» more  ML 2002»
14 years 9 months ago
Structure in the Space of Value Functions
Solving in an efficient manner many different optimal control tasks within the same underlying environment requires decomposing the environment into its computationally elemental ...
David J. Foster, Peter Dayan
87
Voted
ICML
2007
IEEE
15 years 10 months ago
Learning a meta-level prior for feature relevance from multiple related tasks
In many prediction tasks, selecting relevant features is essential for achieving good generalization performance. Most feature selection algorithms consider all features to be a p...
Su-In Lee, Vassil Chatalbashev, David Vickrey, Dap...
CORR
2012
Springer
220views Education» more  CORR 2012»
13 years 5 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
ECML
2005
Springer
15 years 3 months ago
Multi-view Discriminative Sequential Learning
Discriminative learning techniques for sequential data have proven to be more effective than generative models for named entity recognition, information extraction, and other task...
Ulf Brefeld, Christoph Büscher, Tobias Scheff...
WSOM
2009
Springer
15 years 4 months ago
Incremental Figure-Ground Segmentation Using Localized Adaptive Metrics in LVQ
Vector quantization methods are confronted with a model selection problem, namely the number of prototypical feature representatives to model each class. In this paper we present a...
Alexander Denecke, Heiko Wersing, Jochen J. Steil,...