Sciweavers

1419 search results - page 58 / 284
» Approximation Methods for Supervised Learning
Sort
View
DAGM
2004
Springer
14 years 3 months ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
MICCAI
2010
Springer
13 years 8 months ago
Agreement-Based Semi-supervised Learning for Skull Stripping
Abstract. Learning-based approaches have become increasingly practical in medical imaging. For a supervised learning strategy, the quality of the trained algorithm (usually a class...
Juan Eugenio Iglesias, Cheng-Yi Liu, Paul M. Thomp...
SAC
2006
ACM
13 years 10 months ago
Combining supervised and unsupervised monitoring for fault detection in distributed computing systems
Fast and accurate fault detection is becoming an essential component of management software for mission critical systems. A good fault detector makes possible to initiate repair a...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 5 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
ICML
2009
IEEE
14 years 4 months ago
Online learning by ellipsoid method
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
Liu Yang, Rong Jin, Jieping Ye