.png){kind=icon}
.png){kind=icon}
Return
Optimization Attribute Reduction With Fuzzy Rough Sets Based on Algorithm Stability
.png){kind=icon}
PRE
AI
DOI：10.1109/TFUZZ.2023.3342621.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Fuzzy rough sets (FRSs) theory is an important granular computing method to deal with incomplete information systems, and the attribute reduction is a basic key issue in FRSs. In this article, we construct a novel framework for selecting the optimal reduct of FRSs with theoretical guarantees by considering the influence of granule size and incorporating the stability theory in machine learning. First, a granule-based soft-margin support vector machine (GSSVM) algorithm is proposed for classification tasks by introducing the $\lambda$-conditional entropy into the hinge loss function, which takes the impact of granule size on data loss into account. Then, according to stability theory, the generalization error bound of the GSSVM algorithm is derived as a theoretical guarantee for selecting the optimal reduct. Finally, an optimization attribute reduction algorithm (RDROAR) based on the relative discernibility relation is presented by removing the attributes with low importance in a reduct while ensuring the generalization ability of GSSVM. Numerical experiments prove the effectiveness of the improved algorithm as well as verify the rationality and effectiveness of the optimal reduct.
Keywords:
Stability criteria
Uncertainty
Rough sets
Optimization
Numerical stability
Measurement uncertainty
Machine learning algorithms
Attribute reduction
fuzzy rough sets
granule
relative discernibility relation
stability theory
Journal
IF:
11.9
Papers:
4.9K
Citations:
2.9W