Sciweavers

Share
NIPS
2003

Error Bounds for Transductive Learning via Compression and Clustering

12 years 3 months ago
Error Bounds for Transductive Learning via Compression and Clustering
This paper is concerned with transductive learning. Although transduction appears to be an easier task than induction, there have not been many provably useful algorithms and bounds for transduction. We present explicit error bounds for transduction and derive a general technique for devising bounds within this setting. The technique is applied to derive error bounds for compression schemes such as (transductive) SVMs and for transduction algorithms based on clustering.
Philip Derbeko, Ran El-Yaniv, Ron Meir
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where NIPS
Authors Philip Derbeko, Ran El-Yaniv, Ron Meir
Comments (0)
books