暂无评论
对于协调的信息系统,定义了其条件属性集的幂集上的两个闭算子C(R)与C(r),讨论了相应闭集族的性质,并证明了它们与不可辨识属性集族之间的关系.提出属性约简的一种新方法,给出Cr=CR的充要条件,并证
Aiming at the limitations of attribute reduction approach based on .Pawlak attribute significance an
Attribute reduction is one of the key issues in rough set theory. Many heuristic attribute reduction
ATTRIBUTE REDUCTION OF CONCEPT LATTICE BASED ON IRREDUCIBLE ELEMENTS
Attribute reduction with rough sets aims to delete superfluous condition attributes from a decision
This paper proposes a novel approach to attribute reduction in consistent decision tables within the
Covering rough sets generalize traditional rough sets by considering coverings of the universe inste
英国某大学基于粗糙集上的属性约见base=ones(row);r=eval(['ssr'num2str(column)]);attrinu=column-1;forj=attrinu:-1:1sig=
The concept of a consistent approximation representation space is introduced. Many types of informat
Attribute reduction of covering decision systems by hypergraph model
暂无评论