.png){kind=icon}
Return
Partial reduction algorithms for fuzzy relation systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2019.105047.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Relationships among elements of sets appear in many contexts and can be represented using fuzzy relations. A fuzzy relation system is an extensive information system. Attribute reduction is widely used to discover knowledge hidden in databases. Many approaches to reduction based on the rough set theory have been proposed in recent years to deal with information systems, and partial reductions have been proposed in relation to decision systems to extract partial decision rules. This paper considers an approach to fuzzy relation systems based on significant partial attribute reduction by means of discernibility matrices. We propose the concept of X-lower and -upper approximation reductions, and develop their corresponding reduction algorithms. These methods of reduction unify results that have been reported in the literature. We provide examples from the UCI datasets to verify our algorithms. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Discernibility matrix
Fuzzy relation
Fuzzy relation system
Reduction algorithm
Rough set
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more