Sciweavers

2712 search results - page 206 / 543
» On learning algorithm selection for classification
Sort
View
TIT
2008
76views more  TIT 2008»
15 years 6 months ago
Improved Risk Tail Bounds for On-Line Algorithms
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
Nicolò Cesa-Bianchi, Claudio Gentile
BIOINFORMATICS
2006
92views more  BIOINFORMATICS 2006»
15 years 6 months ago
What should be expected from feature selection in small-sample settings
Motivation: High-throughput technologies for rapid measurement of vast numbers of biological variables offer the potential for highly discriminatory diagnosis and prognosis; howev...
Chao Sima, Edward R. Dougherty
IJAR
2010
97views more  IJAR 2010»
15 years 5 months ago
Parameter estimation and model selection for mixtures of truncated exponentials
Bayesian networks with mixtures of truncated exponentials (MTEs) support efficient inference algorithms and provide a flexible way of modeling hybrid domains (domains containing ...
Helge Langseth, Thomas D. Nielsen, Rafael Rum&iacu...
ATAL
2011
Springer
14 years 6 months ago
Metric learning for reinforcement learning agents
A key component of any reinforcement learning algorithm is the underlying representation used by the agent. While reinforcement learning (RL) agents have typically relied on hand-...
Matthew E. Taylor, Brian Kulis, Fei Sha
ICML
2006
IEEE
16 years 7 months ago
Graph model selection using maximum likelihood
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
Adam Kalai, Ivona Bezáková, Rahul Sa...