Adaptive boosting for ordinal target variables using neural networks

Citations

WEB OF SCIENCE

5
Citations

SCOPUS

5

초록

Boosting has proven its superiority by increasing the diversity of base classifiers, mainly in various classification problems. In reality, target variables in classification often are formed by numerical variables, in possession of ordinal information. However, existing boosting algorithms for classification are unable to reflect such ordinal target variables, resulting in non-optimal solutions. In this paper, we propose a novel algorithm of ordinal encoding adaptive boosting (AdaBoost) using a multi-dimensional encoding scheme for ordinal target variables. Extending an original binary-class AdaBoost, the proposed algorithm is equipped with a multi-class exponential loss function. We show that it achieves the Bayes classifier and establishes forward stagewise additive modeling. We demonstrate the performance of the proposed algorithm with a base learner as a neural network. Our experiments show that it outperforms existing boosting algorithms in various ordinal datasets.

키워드

adaptive boostingneural networksordinal classificationClassification (of information)Encoding (symbols)Signal encodingBase classifiersBoosting algorithmEncodingsMulti dimensionalNeural-networksNovel algorithmNumerical variablesOptimal solutionsOrdinal classificationOrdinal informationAdaptive boosting
제목
Adaptive boosting for ordinal target variables using neural networks
저자
Um, InsungLee, GeonseokLee, Kichun
DOI
10.1002/sam.11613
발행일
2023-06
유형
Article; Early Access
저널명
Statistical Analysis and Data Mining
16
3
페이지
257 ~ 271