Sciweavers

662 search results - page 57 / 133
» Making inferences with small numbers of training sets
Sort
View
ICML
2010
IEEE
13 years 10 months ago
Bayesian Multi-Task Reinforcement Learning
We consider the problem of multi-task reinforcement learning where the learner is provided with a set of tasks, for which only a small number of samples can be generated for any g...
Alessandro Lazaric, Mohammad Ghavamzadeh
MICCAI
2008
Springer
14 years 10 months ago
Markov Dependence Tree-Based Segmentation of Deep Brain Structures
We propose a new framework for multi-object segmentation of deep brain structures, which have significant shape variations and relatively small sizes in medical brain images. In th...
Jue Wu, Albert C. S. Chung
TIT
1998
80views more  TIT 1998»
13 years 8 months ago
Structural Risk Minimization Over Data-Dependent Hierarchies
The paper introduces some generalizations of Vapnik’s method of structural risk minimisation (SRM). As well as making explicit some of the details on SRM, it provides a result t...
John Shawe-Taylor, Peter L. Bartlett, Robert C. Wi...
IJPRAI
2002
93views more  IJPRAI 2002»
13 years 8 months ago
Improving Stability of Decision Trees
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
Mark Last, Oded Maimon, Einat Minkov
WWW
2006
ACM
14 years 9 months ago
Interactive wrapper generation with minimal user effort
While much of the data on the web is unstructured in nature, there is also a significant amount of embedded structured data, such as product information on e-commerce sites or sto...
Utku Irmak, Torsten Suel