Low Bias Bagged Support Vector Machines

Proceedings, Twentieth International Conference on Machine Learning

Volumn 2, Issue , 2003, Pages 752-759

  Valentini, Giorgio ^a,b   Dietterich, Thomas G ^c  

^a UNIVERSITY OF MILAN   (Italy)

^b INFM   (Italy)

^c Oregon State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECOMPOSITION; ERROR ANALYSIS; LEARNING SYSTEMS; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING;

BAGGING; LOW-BIAS CLASSIFIERS; SUPPORT VECTOR MACHINES (SVM); VARIANCE REDUCTION;

COMPUTER SCIENCE;

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

References (19)

1. Andersen, T., Rimer, M., & Martinez, T. R. (2001). Optimal artificial neural network architecture selection for voting. Proc. of IJCNN'01 (pp. 790-795). IEEE.
2. Bauer, E., & Kohavi, R. (1999). An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning, 36, 105-139.
3. Breiman, L. (1996). Bagging predictors. Machine Learning, 24, 123-140.
4. Breiman, L. (1998). Arcing classifiers. The Annals of Statistics, 26, 801-849.
5. Breiman, L. (2001). Random Forests. Machine Learning, 45, 5-32.
6. Buciu, I., Kotropoulos, C., & Pitas, I. (2001). Combining Support Vector Machines for Accurate Face Detection. Proc. of ICIP'01 (pp. 1054-1057).
7. Buhlmann, P., & Yu, B. (2002). Analyzing bagging. Annals of Statistics, 30, 927-961.
8. Collobert, R., Bengio, S., & Bengio, Y. (2002). A Parallel Mixture of SVMs for Very Large Scale Problems. Neural Computation, 14, 1105-1114.
9. Derbeko, P., El-Yaniv, R., & Meir, R. (2002). Variance Optimized Bagging. In ECML 2002, vol. 2430 of LNCS, pp. 60-71. Springer-Verlag.
10. Dietterich, T. G. (1998). Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation, 10, 1895-1924.
11. Dietterich, T. G. (2000). An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40, 139-158.
12. th ICML (pp. 231-238).
13. th ICML (pp. 148-156). Morgan Kauffman.
14. Friedman, J. (1997). On bias, variance, 0/1 loss and the curse of dimensionality. Data Mining and Knowledge Discovery, 1, 55-77.
15. James, G. (2003). Variance and bias for general loss function. Machine Learning, (in press).
16. Kim, H., Pang, S., Je, H., Kim, D., & Bang, S. (2002). Pattern Classification Using Support Vector Machine Ensemble. Proc. of ICPR'02 (pp. 20160-20163). IEEE.
17. Merz, C., & Murphy, P. (1998). UCI repository of machine learning databases.
18. Valentini, G., & Dietterich, T. (2002). Bias-variance analysis and ensembles of SVM. MCS2002, Cagliari, Italy (pp. 222-231). Springer-Verlag.
19. Valentini, G., & Masulli, F. (2002). NEURObjects: an object-oriented library for neural network development. Neurocomputing, 48, 623-646.