A Partition-Based Hybrid Algorithm for Effective Imbalanced Classification
Imbalanced classification presents a significant challenge in real-world datasets, requiring innovative solutions to enhance performance. This study introduces a hybrid binary classification algorithm designed to effectively address this challenge. The algorithm identifies different data types, pair...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Data |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2306-5729/10/4/54 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849713974045573120 |
|---|---|
| author | Kittipong Theephoowiang Anantaporn Hanskunatai |
| author_facet | Kittipong Theephoowiang Anantaporn Hanskunatai |
| author_sort | Kittipong Theephoowiang |
| collection | DOAJ |
| description | Imbalanced classification presents a significant challenge in real-world datasets, requiring innovative solutions to enhance performance. This study introduces a hybrid binary classification algorithm designed to effectively address this challenge. The algorithm identifies different data types, pairs them, and trains multiple models, which then vote on predictions using weighted strategies to ensure stable performance and minimize overfitting. Unlike some methods, it is designed to work consistently with both noisy and noise-free datasets, prioritizing overall stability rather than specific noise adjustments. The algorithm’s effectiveness is evaluated using Recall, G-Mean, and AUC, measuring its ability to detect the minority class while maintaining balance. The results reveal notable improvements in minority class detection, with Recall outperforming other methods in 16 out of 22 datasets, supported by paired <i>t</i>-tests. The algorithm also shows promising improvements in G-Mean and AUC, ranking first in 17 and 18 datasets, respectively. To further evaluate its performance, the study compares the proposed algorithm with previous methods using G-Mean. The comparison confirms that the proposed algorithm also exhibits strong performance, further highlighting its potential. These findings emphasize the algorithm’s versatility in handling diverse datasets and its ability to balance minority class detection with overall accuracy. |
| format | Article |
| id | doaj-art-9d27d4001a8c4729ad684fe88791109a |
| institution | DOAJ |
| issn | 2306-5729 |
| language | English |
| publishDate | 2025-04-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Data |
| spelling | doaj-art-9d27d4001a8c4729ad684fe88791109a2025-08-20T03:13:49ZengMDPI AGData2306-57292025-04-011045410.3390/data10040054A Partition-Based Hybrid Algorithm for Effective Imbalanced ClassificationKittipong Theephoowiang0Anantaporn Hanskunatai1Computer Science, School of Science, King Mongkut’s Institute of Technology Ladkrabang, Bangkok 10152, ThailandComputer Science, School of Science, King Mongkut’s Institute of Technology Ladkrabang, Bangkok 10152, ThailandImbalanced classification presents a significant challenge in real-world datasets, requiring innovative solutions to enhance performance. This study introduces a hybrid binary classification algorithm designed to effectively address this challenge. The algorithm identifies different data types, pairs them, and trains multiple models, which then vote on predictions using weighted strategies to ensure stable performance and minimize overfitting. Unlike some methods, it is designed to work consistently with both noisy and noise-free datasets, prioritizing overall stability rather than specific noise adjustments. The algorithm’s effectiveness is evaluated using Recall, G-Mean, and AUC, measuring its ability to detect the minority class while maintaining balance. The results reveal notable improvements in minority class detection, with Recall outperforming other methods in 16 out of 22 datasets, supported by paired <i>t</i>-tests. The algorithm also shows promising improvements in G-Mean and AUC, ranking first in 17 and 18 datasets, respectively. To further evaluate its performance, the study compares the proposed algorithm with previous methods using G-Mean. The comparison confirms that the proposed algorithm also exhibits strong performance, further highlighting its potential. These findings emphasize the algorithm’s versatility in handling diverse datasets and its ability to balance minority class detection with overall accuracy.https://www.mdpi.com/2306-5729/10/4/54imbalanced classificationhybrid algorithmminority class detection |
| spellingShingle | Kittipong Theephoowiang Anantaporn Hanskunatai A Partition-Based Hybrid Algorithm for Effective Imbalanced Classification Data imbalanced classification hybrid algorithm minority class detection |
| title | A Partition-Based Hybrid Algorithm for Effective Imbalanced Classification |
| title_full | A Partition-Based Hybrid Algorithm for Effective Imbalanced Classification |
| title_fullStr | A Partition-Based Hybrid Algorithm for Effective Imbalanced Classification |
| title_full_unstemmed | A Partition-Based Hybrid Algorithm for Effective Imbalanced Classification |
| title_short | A Partition-Based Hybrid Algorithm for Effective Imbalanced Classification |
| title_sort | partition based hybrid algorithm for effective imbalanced classification |
| topic | imbalanced classification hybrid algorithm minority class detection |
| url | https://www.mdpi.com/2306-5729/10/4/54 |
| work_keys_str_mv | AT kittipongtheephoowiang apartitionbasedhybridalgorithmforeffectiveimbalancedclassification AT anantapornhanskunatai apartitionbasedhybridalgorithmforeffectiveimbalancedclassification AT kittipongtheephoowiang partitionbasedhybridalgorithmforeffectiveimbalancedclassification AT anantapornhanskunatai partitionbasedhybridalgorithmforeffectiveimbalancedclassification |