We describe a new Boosting algorithm which combines the base hypotheses with symmetric functions. Among its properties of practical relevance, the algorithm has significant resistance against noise, and is efficient even in an agnostic learning setting. This last property is ruled out for voting-based Boosting algorithms like AdaBoost. Experiments carried out on thirty domains, most of which readily available, tend to display the reliability of the classifiers built.
CITATION STYLE
Nock, R., & Lefaucheur, P. (2002). A robust boosting algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2430, pp. 319–331). Springer Verlag. https://doi.org/10.1007/3-540-36755-1_27
Mendeley helps you to discover research relevant for your work.