Highly imbalanced classification using improved rotation forests Online publication date: Tue, 08-Mar-2016
by Xiaonan Fang; Xiyuan Zheng; Yanyan Tan; Huaxiang Zhang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 10, No. 1, 2016
Abstract: Imbalanced data classification is a challenging problem in data mining. It happens in many real-world applications and has attracted growing attentions from researchers. This issue occurs when the number of one class is much higher than the other class. Ensemble of classifiers has been well known as an effective solution. Then, two novel ensemble algorithms (RUROForest and SROForest) based on rotation forests are proposed for solving highly imbalanced problems. Random under-sampling or SMOTE approaches are combined with rotation forest in the proposed algorithms, which balance the uneven distribution of data sets and keep the diversity of single classifier as well. Focused on two-class highly imbalanced problems, 22 relevant data sets are performed in experiments. Experimental results and statistical analyses show that our proposed methods overtake the state-of-the-art ensemble methods on the most widely used imbalanced measure criterion AUC.
Online publication date: Tue, 08-Mar-2016
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com