.png){kind=icon}
Return
PSU: Particle Stacking Undersampling Method for Highly Imbalanced Big Data
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3009753.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Imbalanced classes are a common problem in machine learning, and the computational costs required for proper resampling increases with the data size. In this study, a simple and effective undersampling method, named particle stacking undersampling (PSU) was proposed. Compared with other competing undersampling methods, PSU can significantly reduce the computational costs, while minimizing information loss to prevent a prediction bias. The performance benchmark applied on 55 binary classification problems indicated that the proposed method not only achieved an enhanced classification performance over other well-known undersampling methods (random undersampling, NearMiss-1, NearMiss-2, cluster centroid, edited nearest neighbor, condensed nearest neighbor, and Tomek Links) but also provided a computational simplicity that can be scalable to large data. Moreover, an experiment verified that two propositions forming the basis of the PSU algorithm can also be applied to other undersampling methods to achieve methodological improvements.
Keywords:
Support vector machines
Training
Stacking
Computational efficiency
Classification algorithms
Licenses
Kernel
Data mining
imbalanced data
undersampling
big data
support vector machines
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
ShareSaveShareSaveScanning mass spectrometer for quantitative reaction studies on catalytically active microstructures
PREAI
ShareSaveShareSaveArsenic removal from aqueous solutions by adsorption using novel MIL-53(Fe) as a highly efficient adsorbent.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSaveShareSave
View more