Highlighting hard patterns via adaboost weights evolution

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

Volumn 2364, Issue , 2002, Pages 72-80

  Caprile, Bruno ^a   Furlanello, Cesare ^a   Merler, Stefano ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY;

ADABOOST ALGORITHM; BIPARTITION; DATA POINTS; DYNAMICAL EVOLUTION; ENTROPY VALUE; HARD POINTS; OPTIMAL SAMPLING; SMOOTH APPROXIMATION;

ADAPTIVE BOOSTING;

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

References (14)

1. [1] Y. Freund and R. E. Schapire, “A Decision-theoretic Generalization of Online Learning and an Application to Boosting,” Journal of Computer and System Sciences, vol. 55, pp. 119–139, August 1997.
2. [2] R. E. Schapire, Y. Freund, P. Bartlett, and W. S. 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.
3. [3] J. Friedman, T. Hastie, and R. Tibshirani, “Additive logistic regression: a statistical view of boosting,” The Annals of Statistics, 2000.
4. [4] R. E. Schapire, “The boosting approach to machine learning: An overview,” in MSRI Workshop on Nonlinear Estimation and Classification, 2002.
5. [5] J. Quinlan, “Bagging, Boosting, and C4.5,” in Thirteenth National Conference on Artificial Intelligence, (Cambridge), pp. 163–175, AAAI Press/MIT Press, 1996.
6. [6] T. G. 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–157, 2000.
7. [7] A. J. Grove and D. Schuurmans, “Boosting in the limit: Maximizing the margin of learned ensembles,” in AAAI/IAAI, pp. 692–699, 1998.
8. [8] G. Rätsch, T. Onoda, and K. Müller, “Soft margins for Adaboost,” Machine Learning, vol. 42, pp. 287–320, 2001.
9. [9] V. Vapnik, The nature of statistical learning theory. Statistics for Engineering and Information Science, Springer Verlag, 2000.
10. [10] W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C – The Art of Scientific Computing. Cambridge University Press, second ed., 1992.
11. [11] W. Härdle, Applied Nonparametric Regression, vol. 19 of Econometric Society Monographs. Cambridge University Press, 1990.
12. [12] V. Fedorov, Theory of Optimal Experiments. Academic Press, New York, 1972.
13. [13] D. D. Lewis and J. Catlett, “Heterogeneous Uncertainty Sampling for Supervised Learning,” in Eleventh International Conference on Machine Learning (Cohen and Hirsh, eds.), (San Francisco), pp. 148–156, Morgan Kaufmann, 1994.
14. [14] Y. Raviv and N. Intrator, “Variance Reduction via Noise and Bias Constraints.,” in Combining Artificial Neural Nets: Ensemble and Modular Multi-Net Systems(A. Sharkey, ed.), (London), pp. 163–175, Springer-Verlag, 1999.