Change search
ReferencesLink to record
Permanent link

Direct link
Non-Convex Potential Function Boosting Versus Noise Peeling: - A Comparative Study
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Social Sciences, Department of Statistics.
2016 (English)Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In recent decades, boosting methods have emerged as one of the leading ensemble learning techniques. Among the most popular boosting algorithm is AdaBoost, a highly influential algorithm that has been noted for its excellent performance in many tasks. One of the most explored weaknesses of AdaBoost and many other boosting algorithms is that they tend to overfit to label noise, and consequently several alterative algorithms that are more robust have been proposed. Among boosting algorithms which aim to accommodate noisy instances, the non-convex potential function optimizing RobustBoost algorithm has gained popularity by a recent result stating that all convex potential boosters can be misled by random noise. Contrasting this approach, Martinez and Gray (2016) propose a simple but reportedly effective way of remedying the noise problems inherent in the traditional AdaBoost algorithm by introducing peeling strategies in relation to boosting. This thesis evaluates the robustness of these two alternatives on empirical and synthetic data sets in the case of binary classification. The results indicate that the two methods are able to enhance the robustness compared to traditional convex potential function boosting algorithms, but not to a significant extent.

Place, publisher, year, edition, pages
2016. , 21 p.
National Category
Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:uu:diva-302289OAI: oai:DiVA.org:uu-302289DiVA: diva2:956975
Subject / course
Statistics
Educational program
Master Programme in Statistics
Available from: 2016-09-01 Created: 2016-08-31 Last updated: 2016-09-01Bibliographically approved

Open Access in DiVA

fulltext(660 kB)12 downloads
File information
File name FULLTEXT01.pdfFile size 660 kBChecksum SHA-512
afca3f580a3279263001ff9dde96ac46e07849a106d3ccbc4b4abf8f09f043c4ad2e2f1af4938eda3fec0da398c25e299a81edcd356f8c33544fc345e2928dcb
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Venema, Viktor
By organisation
Department of Statistics
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 12 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link