A Definition Of Structured Rough Set Approximations

ROUGH SETS AND INTELLIGENT SYSTEMS PARADIGMS, RSEISP 2014(2014)

引用 7|浏览19
暂无评分
摘要
Pawlak lower and upper approximations are unions of equivalence classes. By explicitly expressing individual equivalence classes in the approximations, Bryniarski uses a pair of families of equivalence classes as rough set approximations. Although the latter takes into consideration of structural information of the approximations, it has not received its due attention. The main objective of this paper is to further explore the Bryniarski definition and propose a generalized definition of structured rough set approximations by using a family of conjunctively definable sets. The connections to covering-based rough sets and Grzymala-Busse's LERS systems are investigated.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要