摘要
针对粗糙集所采用化简决策表的方法中存在着求取属性约简和值简式时重复计算的问题进行了改进.提出基于识别矩阵得到决策规则值核的方法,进一步给出基于识别矩阵求取决策规则值简式的算法DMBVR,并证明DMBVR算法能得到决策表中所有决策规则的值简式,从而使计算决策规则的值核与值简式的过程变得更加简便、直观.
The problem in the usual reduction method of a decision table by means of Rough set theory is that it does not make full use of the information given by discernible matrix so that it gives rise to the repeated computation in computing the core value and the value reduction of the decision rules. The present paper aims at improving the present value reduction strategy used widely, which can get the core values of each rule from the discernible matrix. Then the DMBVR algorithm is given, which can get all the value reductions based on the discernible matrix. Finally it is proved that DMBVR algorithm can get all the reductions of each rule and makes the process of computing the core value and the value reduction more simple.
出处
《吉林大学学报(理学版)》
CAS
CSCD
北大核心
2004年第2期221-225,共5页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:60173006)
国家高技术研究发展计划项目(批准号:2003AA118020)
吉林省科技发展计划重大项目(批准号:吉科合字20020303-2)
吉林大学符号计算与知识工程教育部重点实验室资助项目.