摘要
粗糙集的核心问题是知识的约简和获取。该文提出一种基于组合变换的粗糙集属性约简算法,此算法基于数理逻辑的组合推理,采用核属性和单属性进行过滤,并用超集关系对候选约简进行消减。分析表明,算法具有较好的时间复杂度和空间复杂度。
The core problem of rough set is the extracting and reduction of knowledge.In this paper there is introduced an algorithm for rough set theory based on combination and transformation,which filtrates and eliminates the candidate dynamic attribute set by the core attributes and the single attributes according to a lemma of superset relationship in the process of reduction.The analysis shows that the algorithm has a good performance in time and space.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第10期46-48,共3页
Computer Engineering and Applications
关键词
粗糙集
约简算法
区分属性集
超集
rough set,reduction algorithm,discernible attribute set,superset