摘要
不可区分关系是粗糙集理论的基础。针对信息系统,提出了程度不可区分关系的概念来刻画信息系统中对象的可区分性程度的差异。提出了基于程度不可区分关系的粗糙集模型,并讨论了模型的基本性质,最后研究了基于程度不可区分关系的粗糙近似算子与Pawlak近似算子的关系。
The indiscernibility relation is a key notion of rough set theory. We proposed the grade indiscernibility relation for information system to characterize the difference between the grades of discernibility. The rough set model based on grade indiscernibility relation was presented with its basic properties being discussed. Furthermore, the relationship between grade approximation operators and Pawlak approximation operators was analyzed.
出处
《计算机科学》
CSCD
北大核心
2015年第8期240-243,共4页
Computer Science
基金
国家自然科学基金(61473239
61175044
61175055)
中央高校基础研究基金(2682014ZT28)资助
关键词
粗糙集
程度不可区分关系
粗糙近似算子
模糊关系
Rough set, Grade indiscernibility relation, Rough approximation operator, Fuzzy relation