Making AdaBoost Less Prone to Overfitting on Noisy Datasets

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ghadiri Modarres Zainab; SHABANKHAH MAHMOOD; KAMANDI ALI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2020 | Issue:6

Download Full-Text

View:

188

Download:

Information Seminar Paper

Title

Making AdaBoost Less Prone to Overfitting on Noisy Datasets

Author(s)

Ghadiri Modarres Zainab | SHABANKHAH MAHMOOD | KAMANDI ALI

Keywords

Ensemble Learning Algorithms

Boosting

Adaboost

Overfitting

Noise

Web Datasets

Zero_One_Loss

Abstract

Adaboost is perhaps one of the most well-known Ensemble Learning Algorithms. In simple terms, the idea in Adaboost is to train a number of weak learners in an increamental fashion where each new learner tries to focus more on those samples that were misclassfied by the preceding classifiers. Consequently, in the presence of noisy data samples, the new leraners will somehow memorize the data, which in turn will lead to an overfitted model. The main objective of this paper is to provide a generalized version of the Adaboost algorithm that avoids Overfitting, and performs better when the data samples are corrupted with Noise. To this end, we make use of another ensemble learning algorithm called ValidBoost [15], and introduce a mechanism to dynamically determine the thresholds for both the error rate of each classifier and the error rate in each iteration. These threshholds enable us to control the error rate of the algorithm. Experimental simulations have been made on several benchmark datasets including Web Datasets such as “ Website Phishing Data Set” and “ Page Blocks Classification Data Set” to evaluate the performance of our proposed algorithm.

Video