期刊文献+

基于二进制粒子群优化的决策系统属性离散化 被引量:3

Attribute Discretization for Decision System Based on Binary Particle Swarm Optimization
下载PDF
导出
摘要 为解决连续属性无法直接用于粗糙集理论的问题,依据粗糙集连续属性离散化的根本要求,提出了一种基于二进制粒子群优化算法(Binary Particle Swarm Optimization,BinaryPSO)的属性离散化方法。该方法将二进制粒子视为断点子集,最小化断点集中的断点个数作为优化目标,粗糙集属性分类精度作为约束条件。其中,适应函数的定义保证了在尽量减少决策系统信息损失的前提下,得到简化的决策系统。仿真结果表明,该方法得到的离散结果包含较少的断点个数,并且保持了较高的分类能力。 To solve the problem that continuous attributes can not be used directly to rough set theory,an attribute discretization approach based on binary particle swarm optimization is presented according to the basic requirements of rough set continuous theory discretization.Considering binary particle as cut-point set,a minimal set of cut-points is determined as optimal target when rough set attribute classifying precision is taken as constraint condition.The fitness function is defined to get predigested decision system with least loss of decision system information.The simulation result shows that the obtained discrete result contains less cut-points number,and the higher classification ability is maintained.
出处 《控制工程》 CSCD 2008年第4期360-363,共4页 Control Engineering of China
基金 国家自然科学基金资助项目(60674092) 教育部科学技术研究基金资助项目(107058)
关键词 粗糙集 离散化 粒子群 rough set discretization PSO
  • 相关文献

参考文献3

二级参考文献20

  • 1[1]Pawlak Z. Rough stets-theoretical aspects of reasoning about data [M]. Kluwer: Kluwer Academic pub., 1991.
  • 2[2]Kerber R. Discretizaton of numeric attributes[A]. Proceedings 10th national conference on artificial intelligence[C]. New York: MIT Press,1992.
  • 3[1]Vicky M,Natashia B.Heuristic approaches to the asymmetric traveling salesman problem with replenishment arcs[J].International Transactions in Operational Research,2000,7(4):431-447.
  • 4[2]Michel G,Gilbert L,Frédéric S.A tabu search heuristic for the undirected selective traveling salesman problem[J].European Journal of Operational Research,1998,106(2):539-545.
  • 5[3]Kennedy J,Eberhart R C.Particle swarm optimization[C].Australia:IEEE International Conference on Neural Networks,1995.
  • 6[4]Abido M A.Optimal power flow using particle swarm optimization[J].International Journal of Electrical Power and Energy Systems,2002,24(7):563-571.
  • 7[5]Du F,Shi W K,et al.Infrared image segmentation with 2-D maximum entropy method based on particle swarm optimization (PSO)[J].Pattern Recognition Letters,2005,26(5):597-603.
  • 8[6]Shi X H,Xion X L,et al.A discrete PSO method for generalized TSP problem[C].Shanghai:3rd Interntional Conference on Machine Learning and Cybernetics,2004.
  • 9[7]Zhang H,Li X D,Li H,et al.Particle swarm optimization based schemes for resource-constrained project scheduling[J].Automation in Construction,2005,14(3):393-404.
  • 10[8]Goldberg D E.Genetic algodthms in search,optimization and machine learning[M].Boston:Addison-Wesley Reading,1989.

共引文献30

同被引文献25

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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