Large margin vs. large volume in transductive learning

Machine Learning

Volumn 72, Issue 3, 2008, Pages 173-188

  El Yaniv, Ran ^a   Pechyony, Dmitry ^a   Vapnik, Vladimir ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

Large margin; Large volume; Learning principles; Transductive learning; TSVM

Indexed keywords

BOOLEAN FUNCTIONS; OPTIMIZATION; SET THEORY;

BUSINESS MEDIA; DATA-SETS; GEOMETRIC INTERPRETATIONS; HYPOTHESIS SPACE; LARGE MARGINS; NON-CONVEX OPTIMIZATION; TRANSDUCTIVE LEARNING; TRANSDUCTIVE SVM; VOLUME MAXIMIZATION;

EQUIVALENCE CLASSES;

EID: 48349091260     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-008-5071-9     Document Type: Conference Paper

References (20)

1. Bennett, C., & Bredensteiner, E. (2000). Geometry in learning. In Geometry at work (pp. 132-145). Washington: Mathematical Association of America.
2. Blum, A., & Chawla, S. (2001). Learning from labeled and unlabeled data using graph mincuts. In ICML (pp. 19-26).
3. Bousquet, O., & Elisseeff, A. (2002). Stability and generalization. Journal of Machine Learning Research, 2, 499-526.
4. Chapelle, O., Schölkopf, B., & Zien, A. (2006). Semi-supervised learning. Cambridge: MIT Press.
5. Coppersmith, D., & Winograd, S. (1990). Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9, 251-280.
6. Derbeko, P., El-Yaniv, R., & Meir, R. (2004). Explicit learning curves for transduction and application to clustering and compression algorithms. Journal of Artificial Intelligence Research, 22, 117-142.
7. El-Yaniv, R., & Pechyony, D. (2007). Transductive Rademacher complexity and its applications. In COLT.
8. Forsythe, G., & Golub, G. (1965). On the stationary values of a second-degree polynomial on the unit sphere. Journal of the Society for Industrial and Applied Mathematics, 13(4), 1050-1068.
9. Gander, W., Golub, G., & von Matt, U. (1989). A constrained eigenvalue problem. Linear Algebra and Its Applications, 114/115, 815-839.
10. Graepel, T., Herbrich, R., & Obermayer, K. (1999). Bayesian transduction. In NIPS (pp. 456-462).
11. Hanneke, S. (2006). An analysis of graph cut size for transductive learning. In ICML.
12. Horn, R., & Johnson, C. (1990). Matrix analysis. Cambridge: Cambridge University Press.
13. 4) volume algorithm. Journal of Computer and System Sciences, 72(2), 392-417.
14. Nene, S., Nayar, S., & Murase, H. (1996). Columbia object image library (coil-100) (Technical Report CUCS-006-96). Columbia University.
15. Collobert, F., Sinz, R., Weston, J., Bottou, L., (2006). Large scale transductive svms. Journal of Machine Learning Research, 7, 1687-1712.
16. Tong, S., & Koller, D. (2001). Support vector machine active learning with applications to text classification. Journal of Machine Learning Research, 2, 45-66.
17. Vapnik, V. N. (1982). Estimation of dependences based on empirical data. New York: Springer.
18. Vapnik, V. N. (1998). Statistical learning theory. New York: Wiley Interscience.
19. Weston, J., Collobert, R., Sinz, F., Bottou, L., & Vapnik, V. (2006). On the inference with universum. In ICML.
20. Wu, M., & Schölkopf, B. (2007). Transductive classification with local learning regularization. In AISTATS.