Support vector machines, kernel logistic regression and boosting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2364, Issue , 2002, Pages 16-26

  Zhu, Ji ^a   Hastie, Trevor ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Classification; Kernel methods; Logistic regression; Multi class learning; Radial basis; Reproducing kernel Hilbert space (RKHS); Support vector machines

Indexed keywords

ADAPTIVE BOOSTING; CLASSIFICATION (OF INFORMATION); PROBABILITY; REGRESSION ANALYSIS; VECTOR SPACES; VECTORS;

KERNEL METHODS; LOGISTIC REGRESSIONS; MULTI-CLASS LEARNING; RADIAL BASIS; REPRODUCING KERNEL HILBERT SPACES;

SUPPORT VECTOR MACHINES;

EID: 84947609764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45428-4_2     Document Type: Conference Paper

References (13)

1. Evgeniou, T., M. Pontil, and T. Poggio (1999). Regularization networks and support vector machines. Advances in Computational Mathematics (to appear).
2. Freund, Y. and R. E. Schapire (1996). Experiments with a new boosting algorithm. In Machine Learning: Proceedings of the Thirteenth International Conference, pp. 148–156. Morgan Kauffman, San Francisco.
3. Friedman, J., T. Hastie, and R. Tibshirani (2000). Additive logistic regression: a statistical view of boosting (with discussion). Annals of Statistics28, 337–307.
4. Green, P. and B. Silverman (1994). Nonparametric Regression and Generalized Linear Models. Chapman and Hall.
5. Hastie, T. and R. Tibshirani (1990). Generalized Additive Models. Chapman and Hall.
6. Hastie, T., R. Tibshirani, and J. Friedman (2001). The Elements of Statistical Learning; Data mining, Inference and Prediction. New York: Springer Verlag.
7. Kimeldorf, G. and G. Wahba (1971). Some results on tchebycheffian spline functions. J. Math. Anal. Applic.33, 82–95.
8. Lin, X., G. Wahba, D. Xiang, F. Gao, R. Klein, and K. B. (2001). Smoothing spline anova models for large data sets with bernoulli observations and the randomized gacv. Technical Report 998, Department of Statistics, University of Wisconsin.
9. Schapire, R. E. and Y. Freund (1997). Boosting the margin: A new explanation for the effectiveness of voting methods. Proceedings of the Fourteenth International Conference on Machine Learning.
10. Smola, A. and B. Schölkopf (2000). Sparse greedy matrix approximation for machine learning. In Proceedings of the Seventeenth International Conference on Machine Learning. Morgan Kaufmann.
11. Wahba, G., C. Gu, Y. Wang, and R. Chappell (1995). The Mathematics of Generalization., Chapter Soft Classification, a.k.a. Risk Estimation, via Penalized Log Likelihood and Smoothing Spline Analysis of Variance. Santa Fe Institute Studies in the Sciences of Complexity. Addison-Wesley.
12. Wahba, G., Y. Lin, and H. Zhang (2000). Gacv for support vector machines. In A. Smola, P. Bartlett, B. Sch¨olkopf, and D. Schuurmans (Eds.), Advances in Large Margin Classifiers, Cambridge, MA, pp. 297–311. MIT Press.
13. Williams, C. and M. Seeger (2001). Using the nystrom method to speed up kernel machines. In T. K. Leen, T. G. Diettrich, and V. Tresp (Eds.), Advances in Neural Information Processing Systems, Volume 13. MIT Press.