Cost-sensitive adaboost algorithm for ordinal regression based on extreme learning machine

Riccardi, Annalisa and Fernández-Navarro, Francisco and Carloni, Sante (2014) Cost-sensitive adaboost algorithm for ordinal regression based on extreme learning machine. IEEE Transactions on Cybernetics, 44 (10). pp. 1898-1909. ISSN 2168-2275

[img]
Preview
Text (Riccardi-etal-IEEE-TOC-2014-Cost-sensitive-adaboost-algorithm-for-ordinal-regression)
Riccardi_etal_IEEE_TOC_2014_Cost_sensitive_adaboost_algorithm_for_ordinal_regression.pdf
Accepted Author Manuscript

Download (1MB)| Preview

    Abstract

    In this paper, the well known stagewise additive modeling using a multiclass exponential (SAMME) boosting algorithm is extended to address problems where there exists a natural order in the targets using a cost-sensitive approach. The proposed ensemble model uses an extreme learning machine (ELM) model as a base classifier (with the Gaussian kernel and the additional regularization parameter). The closed form of the derived weighted least squares problem is provided, and it is employed to estimate analytically the parameters connecting the hidden layer to the output layer at each iteration of the boosting algorithm. Compared to the state-of-the-art boosting algorithms, in particular those using ELM as base classifier, the suggested technique does not require the generation of a new training dataset at each iteration. The adoption of the weighted least squares formulation of the problem has been presented as an unbiased and alternative approach to the already existing ELM boosting techniques. Moreover, the addition of a cost model for weighting the patterns, according to the order of the targets, enables the classifier to tackle ordinal regression problems further. The proposed method has been validated by an experimental study by comparing it with already existing ensemble methods and ELM techniques for ordinal regression, showing competitive results.