A key challenge in computer vision applications is detecting objects in an image which is a non-trivial problem. One of the better performing proposed algorithms falls within the Viola and Jones framework. They make use of Adaboost for training a cascade of classifiers. The challenges of Adaboost-based face detector include the selection of the most relevant features which are considered as wea...

AdaBoost algorithms fuse weak classifiers to be a strong classifier by adaptively determine fusion weights of weak classifiers. In this paper, an enhanced AdaBoost algorithm by adjusting inner structure of weak classifiers (ISABoost) is proposed. In the traditional AdaBoost algorithms, the weak classifiers are not changed once they are trained. In ISABoost, the inner structures of weak classifi...

In this work, we present a novel classification method for geoinformatics tasks, based on a regularized version of the AdaBoost algorithm implemented in the GIS GRASS. AdaBoost is a machine learning classification technique based on a weighted combination of different realizations of a same base model. AdaBoost calls a given base learning algorithm iteratively in a series of runs: at each run, ...

In the present work, the support vector machine (SVM) and Adaboost-SVM have been used to develop a classification model as a potential screening mechanism for a novel series of 5-HT(1A) selective ligands. Each compound is represented by calculated structural descriptors that encode topological features. The particle swarm optimization (PSO) and the stepwise multiple linear regression (Stepwise-...

AdaBoost has proved to be an effective method to improve the performance of base classifiers both theoretically and empirically. However, previous studies have shown that AdaBoost might suffer from the overfitting problem, especially for noisy data. In addition, most current work on boosting assumes that the combination weights are fixed constants and therefore does not take particular input pa...

We investigate further improvement of boosting in the case that the target concept belongs to the class of r-of-k threshold Boolean functions, which answer “+1” if at least r of k relevant variables are positive, and answer “−1” otherwise. Given m examples of a r-of-k function and literals as base hypotheses, popular boosting algorithms (e.g., AdaBoost) construct a consistent final hypothesis b...

The Adaptive Boosting (AdaBoost) classifier is a widely used ensemble learning framework, and it can get good classification results on general datasets. However, challenging to apply the AdaBoost directly pulmonary nodule detection of labeled unlabeled lung CT images since there are still some drawbacks method. Therefore, solve data problem, semi-supervised using an improved sparrow search alg...

Recently ensemble methods like AdaBoost were successfully applied to character recognition tasks, seemingly defying the problems of overrtting. This paper shows that although AdaBoost rarely overrts in the low noise regime it clearly does so for higher noise levels. Central for understanding this fact is the margin distribution and we nd that AdaBoost achieves { doing gradient descent in an err...

The risk, or probability of error, of the classifier produced by the AdaBoost algorithm is investigated. In particular, we consider the stopping strategy to be used in AdaBoost to achieve universal consistency. We show that provided AdaBoost is stopped after n iterations—for sample size n and ν < 1—the sequence of risks of the classifiers it produces approaches the Bayes risk if Bayes risk L∗ > 0.

The significance of the study of the theoretical and practical properties of AdaBoost is unquestionable, given its simplicity, wide practical use, and effectiveness on real-world datasets. Here we present a few open problems regarding the behavior of “Optimal AdaBoost,” a term coined by Rudin, Daubechies, and Schapire in 2004 to label the simple version of the standard AdaBoost algorithm in whi...