基于区分矩阵与区分函数的同元转换约简算法  

Same Element Conversion Reduction Algorithm Based on Discernibility Matrix and Discernibility Function

作　　者：徐宁[1] 章云[2] 周如旗[3] 

机构地区：[1]上海应用技术学院计算机科学与信息工程学院,上海201418 [2]广东工业大学自动化学院,广州510006 [3]广东第二师范学院计算机科学系,广州510800

出　　处：《计算机工程》2013年第4期39-43,共5页Computer Engineering

基　　金：国家自然科学基金资助项目(U0735003);上海市教育委员会科研创新基金资助项目(060Z021);上海应用技术学院科研计划基金资助项目(YJ2008-07)

摘　　要：针对较大数据集在区分函数范式转换获得约简解集时的困难性,提出一种基于区分矩阵与区分函数的同元转换约简算法。利用区分矩阵保留数据集的全部分类信息,使用区分函数建立分类信息的数学逻辑范式,从低元的合取范式分步转换为析取范式,根据同元转换算法和高元吸收算法,若能够吸收完全则回退,否则再次调用算法进入转换运算。实例演算结果表明,该算法能缩小一次转换规模,灵活地运用递归算法,使得运算简洁有效。Aiming at the difficulties of the form transferring on large datasets to get reducts, a same element conversion reduction algorithm based on discernibility matrix and discernibility function is put forward. It uses discernibility matrix to keep all classification information of data set, and discernibility function constructs the mathematical logic form from the classical information. The algorithm begins from lower rank of Conjunctive Normal Form（CNF） into Disjunctive Normal Form（DNF）. According to the same element conversion algorithm and high element absorption algorithm, if higher ranks are absorbed, the algorithm can return; else the algorithm can enter itself to next circle. Calculation results show that this algorithm greatly reduces the once scale of transform, neatly uses the mature recursive algorithm and works compactly and effectively.

关 键 词：约简算法 广度搜索 区分矩阵 区分函数 范式转换 粗糙集 

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