Sciweavers

1435 search results - page 14 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
ICONIP
2009
13 years 6 months ago
Exploring Early Classification Strategies of Streaming Data with Delayed Attributes
In contrast to traditional machine learning algorithms, where all data are available in batch mode, the new paradigm of streaming data poses additional difficulties, since data sam...
Mónica Millán-Giraldo, J. Salvador S...
NIPS
2003
13 years 9 months ago
Semi-Supervised Learning with Trees
We describe a nonparametric Bayesian approach to generalizing from few labeled examples, guided by a larger set of unlabeled objects and the assumption of a latent tree-structure ...
Charles Kemp, Thomas L. Griffiths, Sean Stromsten,...
ALT
2008
Springer
14 years 5 months ago
Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
Andreas Maurer, Massimiliano Pontil
WAIM
2007
Springer
14 years 2 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
ICCV
2003
IEEE
14 years 10 months ago
Minimally-Supervised Classification using Multiple Observation Sets
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...
Chris Stauffer