Density-Based Clustering to Deal with Highly Imbalanced Data in Multi-Class Problems
Open Access
- 21 September 2023
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 11 (18) , 4008
Abstract
In machine learning and data mining applications, an imbalanced distribution of classes in the training dataset can drastically affect the performance of learning models. The class imbalance problem is frequently observed during classification tasks in real-world scenarios when the available instances of one class are much fewer than the amount of data available in other classes. Machine learning algorithms that do not consider the class imbalance could introduce a strong bias towards the majority class, while the minority class is usually despised. Thus, sampling techniques have been extensively used in various studies to overcome class imbalances, mainly based on random undersampling and oversampling methods. However, there is still no final solution, especially in the domain of multi-class problems. A strategy that combines density-based clustering algorithms with random undersampling and oversampling techniques is studied in this work. To analyze the performance of the studied method, an experimental validation was achieved on a collection of hyperspectral remote sensing images, and a deep learning neural network was utilized as the classifier. This data bank contains six datasets with different imbalance ratios, from slight to severe. The experimental results outperform the classification measured by the geometric mean of the precision compared with other state-of-the-art methods, mainly for highly imbalanced datasets.Keywords
Funding Information
- TecNM (17006.23-P)
This publication has 43 references indexed in Scilit:
- A novel ensemble method for classifying imbalanced dataPattern Recognition, 2015
- Performance Evaluation of K-means Clustering Algorithm with Various Distance MetricsInternational Journal of Computer Applications, 2015
- SCUT: Multi-Class Imbalanced Data Classification using SMOTE and Cluster-based Undersampling2015
- An efficient and simple under-sampling technique for imbalanced time series classification2012
- THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present contextElectronic Notes in Discrete Mathematics, 2007
- A study of the behavior of several methods for balancing machine learning training dataACM SIGKDD Explorations Newsletter, 2004
- A framework for the greedy algorithmDiscrete Applied Mathematics, 2002
- Improving Identification of Difficult Small Classes by Balancing Class Distribution2001
- The condensed nearest neighbor rule (Corresp.)IEEE Transactions on Information Theory, 1968
- The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of VarianceJournal of the American Statistical Association, 1937