新型灰狼算法的粗糙集属性约简及应用  

Rough set attribute reduction of novel grey wolf algorithm and its application

作　　者：白建川 夏克文[1,2] 牛文佳 武盼盼[1,2] BAI Jianchuan;XIA Kewen;NIU Wenjia;WU Panpan(School of Electronics and Information Engineering, Hebei University of Technology, Tianjin 300401, China;Key Lab of Big Data Computation of Hebei Province, Hebei University of Technology, Tianjin 300401, China)

机构地区：[1]河北工业大学电子信息工程学院,天津300401 [2]河北工业大学大数据重点实验室,天津300401

出　　处：《计算机工程与应用》2017年第24期182-186,共5页Computer Engineering and Applications

基　　金：河北省自然科学基金(No.E2016202341);河北省高等学校科学技术研究项目(No.BJ2014013)

摘　　要：粗糙集理论是模式识别和机器学习的重要内容,属性约简是粗糙集理论中核心步骤。然而传统的粗糙集理论对数据集进行属性约简,计算复杂度高,容易陷入局部最优解。提出了一种新型灰狼优化算法的粗糙集属性约简技术,可以很好地解决传统粗糙集理论出现的弊端。同时为了验证算法的可行性,采用国际通用UCI数据库进行验证,与两种传统的属性约简方法进行对比分析。实验结果表明,该方法属性约简个数少,识别精度高,证明该方法切实可行,操作简单。Rough set theory has become an important part of pattern recognition and machine learning,attribute reduction is a core step in rough set theory.However,traditional rough set theory has a high computational complexity and is easy to fall into local optimal solution.In this paper,rough set attribute reduction algorithm of a novel grey wolf algorithm is proposed,which can solve the drawbacks of traditional rough set theory.In order to verify the feasibility of the algorithm,the paper uses the international general UCI database to verify.Then compares it with two traditional attribute reduction methods.The experimental results show that the proposed method has the advantages of less number of attribute reduction and high recognition accuracy.And it is feasible and easy to operate.

关 键 词：粗糙集 属性约简 灰狼算法 

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