期刊文献+

基于二进制粒子群优化算法的零件特征与机床加工关联知识挖掘 被引量:1

Binary Particle Swarm Optimization-based Association Rule Mining for Machine Capabilities and Part Features
下载PDF
导出
摘要 为了充分利用企业历史数据,提出一种基于二进制粒子群优化(BPSO)的关联规则挖掘方法,从数据中提取有用的工艺知识反映产品设计与制造的映射关系;对知识挖掘问题进行描述,建立用于制造过程综合的关联规则挖掘方法框架;对BPSO本身进行改进,提出考虑多个评价指标的适应度函数,并加入相似度指标以消除较差的规则,提高方法在实际问题中的适用性;将所提方法应用于汽车零部件机床加工数据的关联规则挖掘。结果表明,该方法与现有方法相比,平衡了可靠性、相关性及理解性等多个指标,能有效地进行规则挖掘。 To fully utilize the available historical data,a binary particle swarm optimization(BPSO)-based association rule mining(BPSO-ARM)method was proposed.The main idea was to extract knowledge that identified the mapping relationships between product design and manufacturing.Firstly,the research problem was described and the association rule mining framework was established.Improvements were made to enhance the search capability of BPSO.A fitness function considering multiple measures was designed.Moreover,an overlapping measure indication was further proposed to eliminate redundant rules to improve the applicability of the method.Finally,BPSO-ARM was applied to knowledge extraction for the automotive part manufacturing.The results show that BPSO-ARM outperforms other regular methods and is capable of mining association rules with a balance among various measures,including reliability,relevance and comprehensibility.
作者 寇智聪 KOU Zhicong(School of Mechanical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China)
出处 《济南大学学报(自然科学版)》 CAS 北大核心 2019年第5期381-388,共8页 Journal of University of Jinan(Science and Technology)
基金 国家自然科学基金项目(51535007)
关键词 二进制粒子群优化 机床功能 零件特征 关联规则挖掘 binary particle swarm optimization machine capabilities part features association rule mining
  • 相关文献

参考文献3

二级参考文献30

  • 1Eberhart R, Kennedy J. A new optimizer using particle swarm theory. Proceedings of the 6^th International Symposium on Micro Machine and Human Science. Nagoya, Japan, 1995,39-43.
  • 2Kennedy J, Eberhart R. Particle swarm optimization. IEEE International Conference on Neural Networks. Piscataway, New Jersy: IEEE Service Center, 1995, 1942-1948.
  • 3Shi Y, Eberhart R. A modified particle swarm optimizer. IEEE International Conference on Evolutionary Computation. New Jersy: IEEE Press, 1998, 69-73.
  • 4Aler B, Vincent J, Anyakoha C. A review of particle swarm optimization. Natural Computing, 2008, 7(3):109-124.
  • 5LiuJ H, FanXP, QuZH. An improvedparticle swarm optimization with mutation based on similarity. The 3^rd International Conference on Natural Computation. Haikou, China, 2007,9 : 824-828.
  • 6Kennedy J, Eberhart R. A discrete binary version of the particle swarm algorithm. Proceeding of the World Multieonference on Systemics, Cybernetics and Informaties. New Jersy: Piseataway, 1997, 4104-4109.
  • 7Salman A, Ahmad I, Al- madani S. Particle swarm optimization for task assignment problem. Microprocessors and Microsystems, 2002, 26(8) :363-371.
  • 8Lian Z, Gu X, Jiao B. A novel particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Chaos Solitons and Fractals, 2008, 35(5): 851-861.
  • 9Liao C J, Tseng C T, Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problem. Computers and Operations Research, 2007, 34(10): 3099--3111.
  • 10Correa E S, Freitas A A, Johnson C G. Particle swarm for attribute selection in Bayesian classification: An application to protein function prediction. Journal of Artificial Evolution and Applications, 2008, 8(2): 1-12.

共引文献63

同被引文献18

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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