Error bounds for transductive learning via compression and clustering

Advances in Neural Information Processing Systems

Volumn , Issue , 2004, Pages

  Derbeko, Philip ^a   El Yaniv, Ran ^a   Meir, Ron ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BACTERIOPHAGES; ERROR ANALYSIS;

COMPRESSION SCHEME; ERROR BOUND; EXPLICIT ERROR BOUNDS; TRANSDUCTIVE LEARNING;

CLUSTERING ALGORITHMS;

EID: 84892099358     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. V. N. Vapnik. Estimation of Dependences Based on Empirical Data. Springer Verlag, New York, 1982.
2. V. N. Vapnik. Statistical Learning Theory. Wiley Interscience, New York, 1998.
3. T. Joachims. Transductive inference for text classification unsing support vector machines. In European Conference on Machine Learning, 1999.
4. A. Blum and S. Chawla. Learning from labeled and unlabeled data using graph mincuts. In Proceeding of The Eighteenth International Conference on Machine Learning (ICML 2001), pages 19-26, 2001.
5. R. El-Yaniv and O. Souroujon. Iterative double clustering for unsupervised and semisupervised learning. In Advances in Neural Information Processing Systems (NIPS 2001), pages 1025-1032, 2001.
6. T. Joachims. Transductive learning via spectral graph partitioning. In Proceeding of The Twentieth International Conference on Machine Learning (ICML-2003), 2003.
7. D. McAllester. Some PAC-Bayesian theorems. Machine Learning, 37(3):355-363, 1999.
8. D. McAllester. PAC-Bayesian stochastic model selection. Machine Learning, 51(1):5-21, 2003.
9. D. Wu, K. Bennett, N. Cristianini, and J. Shawe-Taylor. Large margin trees for induction and transduction. In International Conference on Machine Learning, 1999.
10. L. Bottou, C. Cortes, and V. Vapnik. On the effective VC dimension. Technical report, AT&T, 1994.
11. G.R.G. Lanckriet, N. Cristianini, L. El Ghaoui, P. Bartlett, and M.I. Jordan. Learning the kernel matrix with semi-definite programming. Technical report, University of Berkeley, Computer Science Division, 2002.
12. A. Blum and J. Langford. Pac-mdl bounds. In COLT, pages 344-357, 2003.
13. W. Hoeffding. Probability inequalities for sums of bounded random variables. J. Amer. Statis. Assoc., 58:13-30, 1963.
14. A. Dembo and O. Zeitouni. Large Deviation Techniques and Applications. Springer, New York, second edition, 1998.
15. D. McAllester. Simplified pac-bayesian margin bounds. In COLT, pages 203-215, 2003.
16. R. Herbrich. Learning Kernel Classifiers: Theory and Algorithms. MIT Press, Boston, 2002.