期刊文献+

基于量子蛙跳协同进化的粗糙属性快速约简 被引量:14

Efficient Rough Attribute Reduction Based on Quantum Frog-Leaping Co-Evolution
下载PDF
导出
摘要 属性约简是粗糙集理论研究的重要内容,现已证明求决策表最小约简是一个典型NP难题.本文提出一种基于量子蛙群协同进化的粗糙属性快速约简算法.该算法构造一种动态多簇的蛙群结构,用量子态比特进行蛙群个体编码,以自适应量子旋转角调整、量子变异和量子纠缠等策略加速蛙群进化收敛,各簇蛙群以双向协同学习机制共享属性约简中相关信息.标准Benchmark优化函数测试结果表明该算法在保证收敛速度同时具有较强的平衡全局优化与局部细致搜索能力.在UCI数据集上进行属性约简比较实验,结果验证了本算法在属性约简精度和效率方面具有明显优势. Attribute reduction is a key studying point of rough set theory.It has been proven that computing minimal reduction of decision tables is a NP-hard problem.An efficient attribute reduction algorithm based on the quantum frog-leaping co-evolution is proposed.A dynamic multi-cluster frog structure is designed,individuals are represented by multi-state qubits.The self-adaptive adjustment of quantum rotation angle,quantum mutation and quantum entanglement strategies are applied to accelerate the convergence.Cooperative searching information of different clusters during attribute reduction is shared by adopting the bidirectional co-evolutionary method.Experiments on some benchmark problems indicate the proposed algorithm has outstanding ability to balance the global exploitation and local exploration on condition of the good convergence,and results on some UCI data sets validate it is more competitive on the attribute reduction accuracy and efficiency,compared to the traditional evolutionary algorithms.
出处 《电子学报》 EI CAS CSCD 北大核心 2011年第11期2597-2603,共7页 Acta Electronica Sinica
基金 国家863高技术研究发展计划(No.2006AA12A106) 国家自然科学基金(No.60873069) 江苏省高校自然科学研究项目(No.09KJD520008) 苏州大学江苏省计算机信息处理技术重点实验室开放课题(No.KJS1023) 2011年江苏省普通高校研究生科研创新计划项目(No.CXZZ11-0219)
关键词 属性约简 量子蛙群进化 双向协同 自适应量子旋转角 动态多簇结构 attribute reduction quantum frog evolution bidirectional cooperation self-adaptive quantum rotation angle dynamic multi-cluster structure
  • 相关文献

参考文献18

  • 1Pawlak Z.Rough sets[J].International Journal of Computer and Information Sciences,1982,11:341-356.
  • 2Peters J F,Skowron A.A rough sets approach to knowledge discovery[J].International Journal of Intelligent Systems,2002,17(2):109-112.
  • 3胡峰,王国胤.属性序下的快速约简算法[J].计算机学报,2007,30(8):1429-1435. 被引量:49
  • 4Wong S K M,Ziarko W.On optimal decision rules in decision tables[J].Bulletin of Polish Academy of Science,1985,33(11):693-696.
  • 5Shor P W.Polynomial-time algorithms for prime factorization and discrete logarithms in a quantumcomputer[J].SIAM Journal on Computer,1997,26 (5):1484-1509.
  • 6Eusuff M M,Lansey K E.Optimization of water distribution network design using the shuffled frog leaping algorithm[J].Journal of Water Resources Planning and Management,2003,129(3):210-225.
  • 7Yang Chengsan,Chuang Liyeh,et al.A combination of shuffled frog-leaping algorithm and genetic algorithm for gene selection[J].Journal of Advanced Computational Intelligence and Intelligent Informatics,2008,12 (3):218-226.
  • 8罗雪晖,杨烨,李霞.改进混合蛙跳算法求解旅行商问题[J].通信学报,2009,30(7):130-135. 被引量:93
  • 9Narayanan A,Moore M.Quantum-inspired genetic algorithm .Proc.of IEEE International Confe-rence on Evolutionary Computation .Piscata-wa:IEEE Press,1996.61-66.
  • 10Han K H,Kim J H.Quantum-inspired evolutionary algorithms with a new termination criterion,gate,and two-phase scheme[J].IEEE Trans on Evolutionary Computation,2004,8(2):156-169.

二级参考文献44

共引文献223

同被引文献152

引证文献14

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部