.png){kind=icon}
.png){kind=icon}
Return
Algorithm for computing all Goldman’s fuzzy reducts
.png){kind=icon}
PRE
AI
DOI：10.1016/j.fss.2025.109747.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• An algorithm, GR-Lex, for computing all Goldman’s fuzzy reducts is introduced • A new ordering of Goldman’s fuzzy reducts search space is proposed • Prunings on the new ordering are introduced. • A density concept for simplified non-Boolean discernibility matrices is introduced • A density-based characterization where our algorithm performs the best is proposed
Journal
IF:
2.7
Papers:
7.6K
Citations:
1.5W