Double-base asymmetric AdaBoost

Neurocomputing

Volumn 118, Issue , 2013, Pages 101-114

  Landesa Vázquez, Iago ^a   Alba Castro, José Luis ^a  

^a UNIVERSITY OF VIGO   (Spain)

Author keywords

AdaBoost; Asymmetry; Boosting; Classification; Cost

Indexed keywords

ASYMMETRY; BOOSTING; COMPUTATIONAL ADVANTAGES; COST-SENSITIVE; COST-SENSITIVE ADABOOST; SEARCH PROCEDURES; THEORETICAL DERIVATIONS; WEAK CLASSIFIERS;

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COSTS; ERROR ANALYSIS;

ADAPTIVE BOOSTING;

ADABOOST; ALGORITHM; ANALYTICAL ERROR; ARTICLE; BAYES THEOREM; CLASSIFICATION ALGORITHM; CLASSIFIER; COST BENEFIT ANALYSIS; INFORMATION PROCESSING; PRIORITY JOURNAL;

EID: 84881250403     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2013.02.019     Document Type: Article

References (28)

1. Schapire R. The strength of weak learnability. Mach. Learn. 1990, 5:197-227.
2. Freund Y., Schapire R. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 1997, 55:119-139.
3. Schapire R., Freund Y., Bartlett P., Lee W. Boosting the margin. a new explanation for the effectiveness of voting methods. Ann. Stat. 1998, 26:1651-1686.
4. Schapire R., Singer Y. Improved boosting algorithms using confidence-rated predictions. Mach. Learn. 1999, 37:297-336.
5. Opitz D., Maclin R. Popular ensemble methods. an empirical study. J. Artif. Intell. Res. 1999, 11:169-198.
6. Friedman J., Hastie T., Tibshirani R. Additive logistic regression. a statistical view of boosting. Ann. Stat. 2000, 28:337-407.
7. Mease D., Wyner A. Evidence contrary to the statistical view of boosting. J. Mach. Learn. Res. 2008, 9:175-194.
8. Viola P., Jones M. Robust real-time face detection. Int. J. Comput. Vision 2004, 57:137-154.
9. Gómez-Verdejo V., Arenas-García J., Figueiras-Vidal A.R. Committees of Adaboost ensembles with modified emphasis functions. Neurocomputing 2010, 73:1289-1292.
10. C. Elkan, The foundations of cost-sensitive learning, in: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001, pp. 973-978.
11. Weiss G., Provost F. Learning when training data are costly. the effect of class distribution on tree induction. J. Artif. Intell. Res. 2003, 19:315-354.
12. G. Karakoulas, J. Shawe-Taylor, Optimizing classifiers for imbalanced training sets, in: Advances in Neural Information Processing Systems, vol. 12, 1999, pp. 253-259.
13. W. Fan, S. Stolfo, J. Zhang, P. Chan, AdaCost: misclassification cost-sensitive boosting, in: Proceedings of the 16th International Conference on Machine Learning, 1999, pp. 97-105.
14. K. Ting, A comparative study of cost-sensitive boosting algorithms, in: Proceedings of the 17th International Conference on Machine Learning, 2000, pp. 983-990.
15. P. Viola, M. Jones, Fast and robust classification using asymmetric AdaBoost and a detector cascade, in: Advances in Neural Information Processing Systems, vol. 14, 2001.
16. Sun Y., Kamel M., Wong A., Wang Y. Cost-sensitive boosting for classification of imbalanced data. Pattern Recognition 2007, 40:3358-3378.
17. Masnadi-Shirazi H., Vasconcelos N. Cost-sensitive boosting. IEEE Trans. Pattern Anal. Mach. Intell. 2011, 33:294-309.
18. H. Masnadi-Shirazi, N. Vasconcelos, Asymmetric boosting, in: Proceedings of the 24th International Conference on Machine Learning.
19. Landesa-Vázquez I., Alba-Castro J. Shedding light on the asymmetric learning capability of AdaBoost. Pattern Recognition Lett. 2012, 33:247-255.
20. Freund Y., Schapire R. A short introduction to boosting. J. Jpn. Soc. Artif. Intell. 1999, 14:771-780.
21. F. Provost, T. Fawcett, Analysis and visualization of classifier performance: comparison under imprecise class and cost distributions, in: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, AAAI Press, 1997, pp. 43-48.
22. Fawcett T. An introduction to ROC analysis. Pattern Recognition Lett. 2006, 27:861-874.
23. C. Drummond, R. Holte, Explicitly representing expected cost: an alternative to ROC representation, in: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '00, ACM, 2000, pp. 198-207.
24. A. Frank, A. Asuncion, UCI Machine Learning Repository, 2010.
25. Dekker T.J. Finding a zero by means of successive linear interpolation. Constructive Aspects of the Fundamental Theorem of Algebra 1969, 37-48. Wiley Interscience. B. Dejon, P. Henrici (Eds.).
26. Brent R.P. Algorithms for Minimization without Derivatives 1973, Prentice Hall.
27. B. Heisele, T. Poggio, M. Pontil, Face detection in still gray images, A.I. memo 1687, Center for Biological and Computational Learning, MIT, Cambridge, MA, 2000.
28. M. Alvira, R. Rifkin, An empirical comparison of SNoW and SVMs for face detection, A.I. memo 2001-004, Center for Biological and Computational Learning, MIT, Cambridge, MA, 2001.