Sciweavers

1435 search results - page 49 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
14 years 11 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 9 months ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg
GLOBECOM
2006
IEEE
15 years 3 months ago
Effect of Channel Estimation Errors on Diversity-Multiplexing Tradeoff in Multiple Access Channels
Abstract— In this paper, multiple access channels are considered in which user data rates increase with the signal-to-noise ratio (SNR). To account for channel estimation errors,...
Ravi Narasimhan
ICML
2006
IEEE
15 years 10 months ago
A continuation method for semi-supervised SVMs
Semi-Supervised Support Vector Machines (S3 VMs) are an appealing method for using unlabeled data in classification: their objective function favors decision boundaries which do n...
Olivier Chapelle, Mingmin Chi, Alexander Zien