An ensemble pruning approach based on reinforcement learning in presence of multi-class imbalanced data

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, learning from imbalanced data sets has become a challenging issue in machine learning and data mining communities. This problem occurs when some classes of data have smaller number of instances than other classes. Multi-class imbalanced data sets have been pervasively observed in many real world applications. Many typical machine learning algorithms pose many difficulties dealing with these kinds of data sets. In this paper, we proposed an ensemble pruning approach which is based on Reinforcement Learning framework. In effect, we were inspired by Markov Decision Process and considered the ensemble pruning problem as a one player game, and select the best classifiers among our initial state space. These selected classifiers which can produce a good ensemble model, are employed to learn from multi-class imbalanced data sets. Our experimental results on some UCI and KEEL benchmark data sets show promising improvements in terms of minority class recall, G-mean, and MAUC.

Cite

CITATION STYLE

APA

Abdi, L., & Hashemi, S. (2014). An ensemble pruning approach based on reinforcement learning in presence of multi-class imbalanced data. In Advances in Intelligent Systems and Computing (Vol. 258, pp. 589–600). Springer Verlag. https://doi.org/10.1007/978-81-322-1771-8_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free