%0 Journal Article
%T High-efficient algorithm for normal form conversion of discernibility function<br>一种高效的分辨函数范式转换算法*
%A ZHANG De-dong
%A LI Ren-pu
%A ZHAO Yong-sheng
%A <br>张德栋
%A 李仁璞
%A 赵永升
%J 计算机应用研究
%D 2010
%I 
%X 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 performance 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.
%K rough sets
%K discernibility function
%K conjunction normal form
%K disjunction normal form<br>粗糙集
%K 分辨函数
%K 合取范式
%K 析取范式
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=ED623F582D388C5695F0738EA4A60CC3&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=38B194292C032A66&sid=D698D0190A84C2BD&eid=8047434EAE0B2346&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=10