In view of this, forward greedy searching to κ-reduct based on granular ball is proposed, which has the following advantages: (1) forming symmetrical granular balls to actualize the grouping of the universe; (2) continuously merging small universes to provide guidance for subsequent calculations; and (3) combining ...
Apr 27, 2023 · Forward greedy searching to κ-reduct based on granular ball is proposed, which has the following advantages: (1) forming symmetrical granular balls to ...
Oct 22, 2024 · In rough set theory,. granule is the division of a sample set, and granular ball is based on the concept of granule. Xia et al. [25] regard ...
Forward greedy searching to κ-reduct based on granular ball is proposed, which has the following advantages: forming symmetrical granular balls to actualize ...
The experimental results indicate that our method can not only ensure the result of reduction has considerable performance in the classification test, but also ...
Forward Greedy Searching to κ-Reduct Based on Granular Ball. Minhui Song, Jianjun Chen, Jingjing Song, Taihua Xu, Yan Fan. Forward Greedy Searching to ...
The purpose of attribute reduction is to prevent too many attributes from affecting classifier operations and reduce the dimensionality of data space. Presently ...
Minhui Song, Jianjun Chen , Jingjing Song, Taihua Xu, Yan Fan: Forward Greedy Searching to κ-Reduct Based on Granular Ball. Symmetry 15(5): 996 (2023).
Oct 11, 2021 · In this study, a granular ball based selector was developed for reducing the dimensions of data from the perspective of attribute reduction.
Mar 15, 2024 · We create a feature selection algorithm for weighted k -nearest neighbors based on the forward greedy search approach to verify the model's ...