Sciweavers

1435 search results - page 26 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
COLT
2005
Springer
15 years 4 months ago
Data Dependent Concentration Bounds for Sequential Prediction Algorithms
Abstract. We investigate the generalization behavior of sequential prediction (online) algorithms, when data are generated from a probability distribution. Using some newly develop...
Tong Zhang
MOC
1998
111views more  MOC 1998»
15 years 2 months ago
The approximation power of moving least-squares
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
David Levin
SAC
2006
ACM
15 years 8 months ago
On the use of spectral filtering for privacy preserving data mining
Randomization has been a primary tool to hide sensitive private information during privacy preserving data mining.The previous work based on spectral filtering, show the noise ma...
Songtao Guo, Xintao Wu
TCS
2010
15 years 1 months ago
Maximal width learning of binary functions
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generali...
Martin Anthony, Joel Ratsaby
KDD
2009
ACM
142views Data Mining» more  KDD 2009»
16 years 3 months ago
Quantification and semi-supervised classification methods for handling changes in class distribution
In realistic settings the prevalence of a class may change after a classifier is induced and this will degrade the performance of the classifier. Further complicating this scenari...
Jack Chongjie Xue, Gary M. Weiss