摘要
针对区分矩阵构造庞大,计算工作量大,基于区分矩阵的约简策略效率低的问题,提出一种新型的针对不完备信息系统的属性约简算法NARIIS。提出的约简算法把属性值的个数应用到属性约简上,使该约简算法的时间和空间复杂度都远小于基于区分矩阵的约简策略。
The paper aims at the matter of the heavy workload of discernibility matrix and the inefficient of the reduction strategy based discernibility matrix,A new attributes reduction arithmetic (NARIIS) aiming at imperfect information systems is proposed. We apply the number of attributes to the attributes reduction so that thet the spatial-temporal complexity of the NARIIS is less than that of the reduction strategy based discernibihty matrix.
出处
《微电子学与计算机》
CSCD
北大核心
2007年第4期204-207,共4页
Microelectronics & Computer
基金
国家自然科学基金项目(60573056)
浙江省自然科学基金项目(Y105090)
关键词
粗糙集
属性约简策略
不完备信息系统
区分矩阵
rough sets
attributes reduction strategy
imperfect information systems
discernibility matrix