粗糙集理论中分辨函数的析取范式生成算法  

Disjunctive Normal Form Generation Algorithm for Discernibility Function in Rough Set Theory

作　　者：赵荣泳[1] 张浩[2] 李翠玲[3] 陆剑锋[1] 王骏[4] 

机构地区：[1]同济大学CIMS研究中心,上海200092 [2]上海电力学院,上海200090 [3]上海海事大学电气系,上海200135 [4]上海大众汽车有限公司,上海201805

出　　处：《计算机工程》2006年第2期183-185,共3页Computer Engineering

基　　金：中德政府合作项目资助(20002DFG00027)

摘　　要：基于粗糙集理论,研究分辨函数(DF)的析取范式的自动生成算法,提出由分辨矩阵到合取项矩阵(CM)的计算方法。建立了从属性约简的合取项矩阵(CM)到析取项矩阵(DM)转换的数学模型,并给出了算法的实现流程。基于数学模型,提出直接搜索的转换方法,节省了运算空间,降低了算法的时间复杂性,提高了规则生成的效率。最后通过UCI数据库的实例验证了算法的有效性。The automatic generation algorithm of discernibility function＇s disjunctive normal fonn（DNF） is studied based on rough set theory. The tansfonnation method form discernibility matrix to conjunction matrix is presented. And the mathimetic model of the transformation from conjunction matrix to disjunction matrix is esteblished for the attribute reduct, then the program flow graph is also put forward. Based on the model, direct search method is presented which can save the computing space and CPU occupation time, enhance the efficiency of decision rules generation. Finally, by the factual process for UCI database, the validity of direct serach method is proved.

关 键 词：粗糙集 属性约简 析取范式 

分 类 号：TP301.5[自动化与计算机技术—计算机系统结构]