Generalized Undersampling of Center Points Based on Granular Ball
Hao Bai, Yanmin Wu, JinLi Qi, YanYi Chen · 2022
In this paper, we propose a new generic sampling classification method based on granular Ball sampling because of good robust noise immunity and possessing properties that can be classified as an undersampling method, called Granular Ball Center-based Common Under-sampling. The method uses adaptively generated Ball to cover the data space, and the sampled data are supported by the centroid properties of the Ball. Unlike the boundary sampling of granular ball sampling, this method mainly uses the center points to smooth out the noise, which not only can clearly represent the attributes, but also can reduce some computational effort, and in most of the time, it can obtain almost the same accuracy as the original model, or even can perform better. Compared with undersampling, it can be better adapted to the task of unbalanced classification as well as non-unbalanced classification. The above can show that the method is able to be generalized without the restriction of specific classifiers and also has a strong adaptability to the dataset. The method can also be effectively used as an undersampling method for unbalanced classification because it is supported by the centroid property, and the method has a speedup effect for most classifiers. These advantages form a strong advantage of the method in improving classifier performance.