Tuning cost-sensitive boosting and its application to melanoma diagnosis

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

Volumn 2096, Issue , 2001, Pages 32-42

  Merler, Stefano ^a   Furlanello, Cesare ^a   Larcher, Barbara ^a   Sboner, Andrea ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; CLASSIFICATION (OF INFORMATION); COMPUTER AIDED DIAGNOSIS; ONCOLOGY;

AUTOMATIC DIAGNOSIS; AUTOMATIC SYSTEMS; BINARY CLASSIFICATION PROBLEMS; BOOSTING ALGORITHM; CLASSIFICATION PERFORMANCE; MULTIPLE CLASSIFIER COMBINATION; SEARCH PROCEDURES; SENSITIVITY AND SPECIFICITY;

DERMATOLOGY;

EID: 84957030794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48219-9_4     Document Type: Conference Paper

References (14)

1. N. Adams and D. Hand, “Classifier performance assessment,” Neural Computation, vol. 12, no. 2, pp. 305-311, 2000.
2. L. Bischof, H. Talbot, E. Breen, D. Lovell, D. Chan, G. Stone, S. Menzies, A. Gutenev, and R. Caffin, “An automated melanoma diagnosis system,” in New Approaches in Medical Image Analysis (B. Pham, M. Braun, A. Maeder, and M. Eckert, eds.), SPIE, 1999.
3. E. Blanzieri, C. Eccher, S. Forti, and A. Sboner, “Exploiting classifier combination for early melanoma diagnosis support,” in Proceedings of ECML-2000 (R. de Man- taras and E. Plaza, eds.), (Berlin), pp. 55-62, Springer-Verlag, 2000.
4. L. Breiman, J. Friedman, R. Olshen, and C. Stone, Classification and Regression Trees. Pacific Grove CA: Wadsworth and Brooks/Cole, 1984.
5. L. Breiman, “Combining predictors,” in Combining Artificial Neural Nets: Ensemble and Modular Multi-Net Systems (A. Sharkey, ed.), (London), Springer-Verlag, pages 31-50.
6. T. Dietterich, “An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization,” Machine Learning, vol. 40, no. 2, pp. 139-158, 2000.
7. W. Fan, S. Stolfo, J. Zhang, and P. Chan, “Adacost: Misclassification cost-sensitive boosting,” in Proceedings of ICML-99, 1999.
8. Y. Freund and R. Schapire, “A decision-theoretic generalization of online learning and an application to boosting,” Journal of Computer and System Sciences, vol. 55, no. 1, pp. 119-139, 1997.
9. J. Friedman, T. Hastie, and R. Tibshirani, “Additive logistic regression: a statistical view of boosting,” tech. rep., Stanford University, 1999.
10. C. Furlanello and S. Merler, “Boosting of tree-based classifiers for predictive risk modeling in gis,” in Multiple Classifier Systems (J. Kittler and F. Roli, eds.), vol. 1857, (Amsterdam), Springer, 2000. pages 220-229.
11. G. Karakoulas and J. Shawe-Taylor, “Optimizing classifiers for imbalanced training sets,” in Advances in Neural Information Processing Systems 11 (M. Kearns, S. Solla, and D. Cohn, eds.), MIT Press, 1999.
12. D. Margineantu and T. Dietterich, “Bootstrap methods for the cost-sensitive evaluation of classifiers,” in Proceedings of ICML-2000, pp. 583-590, Morgan Kaufmann, 2000.
13. R. Schapire, Y. Freund, P. Bartlett, and W. Lee, “Boosting the margin: a new explanation for the effectiveness of voting methods,” The Annals of Statistics, vol. 26, no. 5, pp. 1651-1686, 1998.
14. K. Ting, “A comparative study study of cost-sensitive boosting algorithms,” in Proceedings of ICML-2000 (M. Kaufmann, ed.), pp. 983-990, 2000.