.png){kind=icon}
返回
Partial reduction algorithms for fuzzy relation systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2019.105047.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Discernibility matrix
Fuzzy relation
Fuzzy relation system
Reduction algorithm
Rough set
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Variable-precision dominance-based rough set approach and attribute reduction基于变精度优势的粗糙集方法及属性约简
PREAI
分享收藏
查看更多内容