首页 | 本学科首页   官方微博 | 高级检索  
     

基于群体智能算法的粗糙集约简方法研究
引用本文:李文,孔凡林.基于群体智能算法的粗糙集约简方法研究[J].数字社区&智能家居,2009,5(6):4254-4256.
作者姓名:李文  孔凡林
作者单位:大连交通大学软件学院,辽宁大连116028
基金项目:基金项目:国家基金项目(牵引电机传动系统振动与噪声分数阶控制研究,项目编号:6087009);辽宁省教育厅研究项目(交流电机控制系统振动抑制方法研究,项目编号:20060111)
摘    要:随着粗糙集理论的应用越来越广泛,寻找一个适当的方法进行粗糙集约简已成为一个关键问题,同时这也成为研究粗糙集理论的瓶颈。粒子群优化算法(PSO)起源对简单社会系统的模拟,对解决这个问题具有特别的优势。同时该文用遗传算法(GA)来评价提出来的粒子群优化的成效,结果发现,在解决某些粗糙集约简问题上,PSO更具优势。

关 键 词:粗糙集  粒子群优化  约简

Research of Rough Set-Simplifying Based on PSO
LI Wen,KONG Fan-lin.Research of Rough Set-Simplifying Based on PSO[J].Digital Community & Smart Home,2009,5(6):4254-4256.
Authors:LI Wen  KONG Fan-lin
Affiliation:(Software Institute of Dalian Jiaotong University, Dalian 116028, China)
Abstract:With the applications of rough set theory becoming more and more widely, looking for an appropriate method of Rough SetSimplifying has become a key issue, while this study has also become a bottleneck of rough set theory. The new optimization which originates from a simple simulation of social systems is particularly attractive in this problem. In this paper, genetic algorithms (GA) are used to evaluate the effectiveness of particle swarm optimization and found that, PSO may do some better in specific situations.
Keywords:Rough Set  PSO  simplify
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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