RAMEN: A Ratio-Weighted Majority Entropy- Based Decision Tree Algorithm for Classifying Imbalanced Datasets

Dealing with imbalanced datasets is an essential part of most analytic lifecycles. However, an inadequate classification of imbalance datasets may result in the loss of information and insights, as well as in the reduced repurposability of the data. While most well-known classification algorithms, including the decision tree algorithm, can efficiently make predictions from balanced datasets, these algorithms are inefficient when classifying imbalanced datasets. To address this concern, the present study, building on a traditional decision tree classification algorithm – namely, the ID3 algorithm –proposes a ratio-weighted majority entropy decision tree algorithm (RAMEN). RAMEN removes bias toward the majority class in imbalanced datasets. The RAMEN algorithm is then tested on two imbalanced datasets: a cancer case dataset and a banknote verification dataset. Comparing the performances of the RAMEN technique with those of the traditional ID3 decision tree algorithm and the minority entropy-based decision tree algorithm, we find that RAMEN outperforms both aforementioned algorithms for the two datasets.