用于粗糙集约简的并行算法  

Parallel Algorithm for Rough Set Reduction

作　　者：孙涛[1] 董立岩[1] 李军[1] 张羽翔[1] 

机构地区：[1]吉林大学计算机科学与技术学院,长春130012

出　　处：《吉林大学学报（理学版）》2006年第2期211-216,共6页Journal of Jilin University:Science Edition

基　　金：吉林省自然科学基金(批准号:19990528);国家博士后科研基金(批准号:2004035170)

摘　　要：通过对数据挖掘粗糙集约简算法的研究,提出一种基于区分能力指数的信息系统数据划分思想.先将系统按属性区分能力分成若干子表,再由子表的约简求原系统的约简,这种思想较好地简化了布尔函数的化简过程.根据该思想设计了一个属性约简并行算法,并利用Petri网模拟工具CPN Tools对算法的负载平衡进行了分析,通过实验与相应的串行算法在时间上进行了对比,实验结果显示,该算法对于对象较多的大规模系统具有较高的效率.By the research of data mining rough set reduct, the author propounded a data dividing thought based on the discernibility ability of index. First the information system was divided into many small tables, then the final reduction was resolved from the small table reduction. This thought has predigested the reduction of the bool function reduction. And based on this thought, a parallel algorithm of attribute reduction was designed. By using the simulate tool CPN Tools of Petri Nets, the load balance of the algorithm was analyzed. On the basis of the experimental results compared with the corresponding serial algorithm, it is shown that the parallel algorithm is more efficient for the large scale system with excessive objects.

关 键 词：数据挖掘 粗糙集 属性约简 并行算法 

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