首页 | 官方网站   微博 | 高级检索  
     

基于GA-PSO混合算法的最小属性约简
引用本文:吕振中,薛惠锋,钟明,刘欢.基于GA-PSO混合算法的最小属性约简[J].计算机工程与应用,2012,48(1):53-56.
作者姓名:吕振中  薛惠锋  钟明  刘欢
作者单位:西北工业大学自动化学院,西安,710072
基金项目:西北工业大学科技创新基金(No.2008KJ02042).
摘    要:属性约简是粗糙集理论中的核心问题,为有效进行属性的最小约简,将一种GA-PSO混合算法应用于属性约简。该算法在保证寻优能力的前提下,增加群体的多样性,避免陷入局部最优,同时,在适应度函数中加入罚函数。实验结果证明该算法能有效地进行属性约简,取得良好的约简结果。

关 键 词:粗糙集  属性约简  粒子群算法和遗传算法融合的混合算法(GA-PSO)
修稿时间: 

Minimal attribute reduction algorithm based on GA-PSO
LV Zhenzhong , XUE Huifeng , ZHONG Ming , LIU Huan.Minimal attribute reduction algorithm based on GA-PSO[J].Computer Engineering and Applications,2012,48(1):53-56.
Authors:LV Zhenzhong  XUE Huifeng  ZHONG Ming  LIU Huan
Affiliation:(College of Automation, Northwestern Polytechnical University, Xi'an 710072, China)
Abstract:Attribute reduction is a key point of rough set theory. In order to get minimal subsets of attributes, this paper uses a GA-PSO mixed algorithm applying to attribute reduction. This algorithm in the premise of ensuring optimal ability, increases the diversity of population, and avoids being trapped in the local optimum, in the meantime, adds the penalty function in the fitness function. The experiment results show that it not only keeps the ability in getting reduction but also deduces the number of attribution, and it can obtain the prime effect.
Keywords:rough set attribute reduction Genetic Algorithm-Particle Swarm Optimization(GA-PSO)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号