Multi-class Boosting for imbalanced data.

We consider the problem of multi-class classification with imbalanced data-sets. To this end, we introduce a cost-sensitive multi-class Boosting algorithm (BAdaCost) based on a generalization of the Boosting margin, termed multi-class cost-sensitive margin. To address the class imbalance we introduce a cost matrix that weighs more hevily the costs of confused classes and a procedure to estimate these costs from the confusion matrix of a standard 0|1-loss classifier. Finally, we evaluate the performance of the approach with synthetic and real data-sets and compare our results with the AdaC2.M1 algorithm

Classification with Extreme Learning Machine and Ensemble Algorithms Over Randomly Partitioned Data

In this age of Big Data, machine learning based data mining methods are extensively used to inspect large scale data sets. Deriving applicable predictive modeling from these type of data sets is a challenging obstacle because of their high complexity. Opportunity with high data availability levels, automated classification of data sets has become a critical and complicated function. In this paper, the power of applying MapReduce based Distributed AdaBoosting of Extreme Learning Machine (ELM) are explored to build reliable predictive bag of classification models. Thus, (i) dataset ensembles are build; (ii) ELM algorithm is used to build weak classification models; and (iii) build a strong classification model from a set of weak classification models. This training model is applied to the publicly available knowledge discovery and data mining datasets.Comment: In Turkish, SI

The Fast Integration of a Rotated Rectangle Applied to the Rotated Haar-like Features for Rotated Objects Detection

The Integral Image technique, used by Viola and Jones, is generally used to calculate the integral of a rectangular filter in an input picture. This filter is a rectilinear rectangle. We propose a method to integrate a rotated one by any angle of rotation inside an image based on the Bresenham algorithm of drawing a segment. We use some pixels 2013; called key points - that forms the four segments of a rotated rectangle, to calculate its Integral Image. Our method focuses on three essential tasks; the first is to determine the rule for drawing a segment (SDR), the second is to identify all the key points of the rectangle r, and the third is to calculate the integral image. The speed of this method depends on the size and angle of rotation of the rectangle. To demonstrate the efficiency of our idea, we applied it to the rotated Haar-like features that we proposed in a later work [12], which had as objectives the improvement of the Viola and Jones algorithm to detect the rotated faces in a given image. We performed tests on more widespread databases of images, which showed that the application of this technique to rotated Haar-Like features improves the performance of object detectors, in general, and faces in particular