基于频率函数循环重计算的属性约简和挖掘算法研究  

Research of Algorithm for Attributes Reduction and Mining Based on Re-Calculated Frequency Function

作　　者：张臻[1] 陈婕[1] 丁卫平[1] 

机构地区：[1]南通大学计算机科学与技术学院,江苏南通226019

出　　处：《计算机工程与科学》2009年第10期108-111,共4页Computer Engineering & Science

基　　金：南通市应用研究计划资助项目(K2008031);南通大学大学生课外学术科技作品立项课题(2007-226)

摘　　要：针对经典HORAFA启发式约简算法在以属性频率为重要启发信息约简时,往往不能获得最优属性约简集的问题,本文提出了基于属性频率函数循环重计算的改进启发式约简和挖掘算法(BRFA算法)。该算法在已约简属性基础上,进行剩余属性频率函数的循环重计算,直至区分矩阵为空,能大大节省决策表的最小约简时间并能得到所有相对约简。通过实例分析和UCI机器学习数据库实验表明,BRFA算法在属性约简和挖掘方面具有较好的性能。Attributing to the shortage of the typical heuristic algorithm （HORAFA） of the attribute reduction, which can not often get the superior reduction when the attribute frequency is selected as the important heuristic information. The Re-calculation of the Frequency Algorithm（BRFA） is proposed, Which can not re-calculate the frequency function until the discernibility matrix is empty based on the attribute reduction. This algorithm can save some time of acquiring the least reduction in the decision table and get all of the relative reductions. Finally, both the analyzed example and the experimental results by the UCI Machine Learning Date Sets shows that BRFA algorithm is proved more effective in attribute reduction.

关 键 词：粗糙集 启发式约简 属性频率 循环重计算 规则挖掘 

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