The Generation Algorithm of Minimal DNF for Discernibility Function in Rough Set Theory

摘要：

The generation method of the disjunctive normal form (DNF)for discernibility function is one of the important factors which influence the efficiency of attribute reduction based on Skowron discernibility matrix.The direct search method based on mathematic model has problems such as waste of memory space and CPU occupation time because the calculated result is not a minimal DNF for discenibility functions.Aim at problems mentioned above,a novel algorithm which can directly generate the minimal DNF of discernibility functions combining with the simple matrix operations jS presented.This algorithm saves memory space and CPU occupation time,and enhances the generation efficiency of decision rules through the way of using simple matrix operations instead of using complicated generation procedure of DNF for discernibility fonction.

作者: Zhiwei Yin Dan Li Jianpei Zhang

会议类型: 国际会议

会议名称: The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)

会议地点: 成都

会议语种:英文

页码: 215-518

在线出版日期: 2007-12-19（万方平台首次上网日期，不代表论文的发表时间）