一种高效的分辨函数范式转换算法  

High-efficient algorithm for normal form conversion of discernibility function

作　　者：张德栋[1] 李仁璞[1] 赵永升[1] 

机构地区：[1]鲁东大学计算机科学与技术学院,山东烟台264025

出　　处：《计算机应用研究》2010年第3期879-882,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(60875039);山东省中青年科学家奖励基金资助项目(2008BS01014);鲁东大学创新团队建设项目(08-CXB006)

摘　　要：基于分辨矩阵获取一个决策表所有约简的过程实质上是一个将分辨函数从合取范式转换为析取范式的过程,其效率对于属性约简算法性能至关重要。依据人工范式转换的运行机制,充分利用合取运算和析取运算的吸收率,并借助队列结构,提出了一种面向分辨函数的范式转换算法。该算法易于理解,实现简便。仿真实验表明算法能够高效地完成范式转换。The process obtaining all reducts of a decision table based on discernibility matrix is virtually a process transforming a discernibility function from conjunction normal form to disjunction normal form, and the transformation efficiency plays an important role in the perforrn ance of attribute reduction algorithm. Through making the best of the absorptivity of conjunction operation and disjunction operation, based on the mechanism of artificial normal form conversion, proposed an algorithm transforming a discernibility function from conjunction normal form to disjunction normal form with virtue of queue framework. This algorithm was easy to understand and to realize. And the simulative experiments show that it is very efficient to accomplish normal form conversion.

关 键 词：粗糙集 分辨函数 合取范式 析取范式 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]