ν-Arc: Ensemble learning in the presence of outliers

Advances in Neural Information Processing Systems

Volumn , Issue , 2000, Pages 561-567

  Ratsch G ^a   Scholkopf B ^b   Smola, A ^c   Muller K R ^a   Onoda, T ^d   Mika, S ^a  

^a FRAUNHOFER FIRST   (Germany)

^b MICROSOFT RESEARCH   (United Kingdom)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^d CENTRAL RESEARCH INSTITUTE OF ELECTRIC POWER INDUSTRY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

STATISTICS;

BOOSTING ALGORITHM; CLASSIFICATION TASKS; DECISION BOUNDARY; ENSEMBLE LEARNING; ENSEMBLE METHODS; ERROR FUNCTION; GRADIENT DESCENT; MARGIN DISTRIBUTIONS;

ADAPTIVE BOOSTING;

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

References (17)

1. C. Blake' E. Keogh' and C J. Merz. UCI repository of machine learning databases' 1998. http://www.ics.uci.edu/~mlearn/MLRepository.html
2. L. Breiman. Prediction games and arcing algorithms. Technical Report 504' Statistics Department' University of California' December 1997.
3. M. Prean and T. Downs. A simple cost function for boosting. Technical report' Dept. of Computer Science and Electrical Eng.' University of Queensland' 1998.
4. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. In Computational Learning Theory: Eurocolt '95' pages 23-37. Springer-Verlag' 1995.
5. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. J. of Comp. & Syst. Sc.' 55(1):119-139' 1997.
6. J. Friedman' T. Hastie' and R. Tibshirani. Additive logistic regression: a statistical view of boosting. Technical report' Stanford University' 1998.
7. A. Grove and D. Schuurmans. Boosting in the limit: Maximizing the margin of learned ensembles. In Proc. of the 15th Nat. Conf. on AI' pages 692-699' 1998.
8. Y. LeCun' L. D. Jackel' L. Bottou' C. Cortes' J. S. Denker' H. Drucker' I. Guyon' U. A. Müller' E. Saekinger' P. Simard' and V. Vapnik. Learning algorithms for classification: A comparison on handwritten digit recognition. Neural Networks' pages 261-276' 1995.
9. L. Mason' P. L. Bartlett' and J. Baxter. Improved generalization through explicit optimization of margins. Machine Learning' 1999. to appear.
10. J. R. Quinlan. Boosting first-order learning (invited lecture). Lecture Notes in Computer Science' 1160:143' 1996.
11. G. Ratsch' T. Onoda' and K.-R. Müller. Soft margins for AdaBoost. Technical Report NC-TR-1998-021' Department of Computer Science' Royal Holloway' University of London' Egham' UK' 1998. To appear in Machine Learning.
12. G. Ratsch' B. Schokopf' A. Smola' S. Mika' T. Onoda' and K.-R. Müller. Robust ensemble learning. In A.J. Smola' P.L. Bartlett' B. Scholköpf' and D. Schuurmans' editors' Advances in LMC' pages 207-219. MIT Press' Cambridge' MA' 1999.
13. R. Schapire' Y. Freund' P. L. Bartlett' and W. Sun Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. Annals of Statistics' 1998. (Earlier appeared in: D. H. Fisher' Jr. (ed.)' Proc. ICML97' M. Kaufmann).
14. B. Scholköpf' C. J. C. Burges' and A. J. Smola. Advances in Kernel Methods - Support Vector Learning. MIT Press' Cambridge' MA' 1999.
15. B. Scholköpf' A. Smola' R. C. Williamson' and P. L. Bartlett. New support vector algorithms. Neural Computation' 12:1083-1121' 2000.
16. H. Schwenk and Y. Bengio. Training methods for adaptive boosting of neural networks. In Michael I. Jordan' Michael J. Kearns' and Sara A. Solla' editors' Advances in Neural Inf. Processing Systems' volume 10. The MIT Press' 1998.
17. V. Vapnik. The Nature of Statistical Learning Theory. Springer Verlag' New York' 1995.