1435 search results - page 8 / 287 » Generalization Error Bounds Using Unlabeled Data |
KDD
2008
ACM
14 years 7 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
SGP
2007
13 years 9 months ago
2007
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We investigate the empirical applicability of several bounds (a number of which are new) on the true error rate of learned classifiers which hold whenever the examples are chosen ...
NIPS
2003
13 years 8 months ago
2003
We consider the general problem of learning from labeled and unlabeled data, which is often called semi-supervised learning or transductive inference. A principled approach to sem...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...