Sciweavers

3837 search results - page 139 / 768
» Learning Approximate Consistencies
Sort
View
NIPS
1994
15 years 5 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad
ICML
1998
IEEE
16 years 5 months ago
Intra-Option Learning about Temporally Abstract Actions
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...
Richard S. Sutton, Doina Precup, Satinder P. Singh
ICML
2009
IEEE
16 years 5 months ago
Analytic moment-based Gaussian process filtering
We propose an analytic moment-based filter for nonlinear stochastic dynamic systems modeled by Gaussian processes. Exact expressions for the expected value and the covariance matr...
Marc Peter Deisenroth, Marco F. Huber, Uwe D. Hane...
ICML
2003
IEEE
16 years 5 months ago
Link-based Classification
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...
Qing Lu, Lise Getoor
MCS
2010
Springer
15 years 11 months ago
Multi-information Ensemble Diversity
Abstract. Understanding ensemble diversity is one of the most important fundamental issues in ensemble learning. Inspired by a recent work trying to explain ensemble diversity from...
Zhi-Hua Zhou, Nan Li