首页> 外文期刊>Neural computing & applications >Productive service demands modularization for CNC machine tools based on the improved AP clustering algorithm
【24h】

Productive service demands modularization for CNC machine tools based on the improved AP clustering algorithm

机译:基于改进的AP聚类算法,生产服务要求CNC机床的模块化

获取原文
获取原文并翻译 | 示例
           

摘要

The integration of manufacturing and service industry has become the mainstream trend. During the manufacturing process, CNC machine tools, as large-scale and complex equipment, involve a variety of service demands in the life cycle, especially the productive service demands are numerous and scattered. The article established the correlation model between customer demands and productive service demands based on clustering ideas and mathematical statistics theory to complete the modularization of productive service demands for CNC machine tools. A comprehensive correlation coefficient model and an improved AP clustering algorithm were put forward. The comprehensive correlation coefficient model mined the correlation between customer demand and production service demand and the self-correlation of production service demands directly based on the combination weight obtained by the analytic hierarchy process and rough set theory. The improved AP clustering algorithm was the combination of AP and Kruskal minimum tree principle. By this new algorithm, the clustering project of productive service demands for every customer demand could be attained. Finally, the five matrices can be computed in 1083?ms, 1067?ms, 1029?ms, 1149?ms and 1042?ms, respectively, by the improved AP clustering algorithm. However, the original AP method should spend 1122?ms, 1241?ms, 1231?ms, 1383?ms and 1231?ms, respectively. So it was very clear that the improved AP clustering algorithm can improve the data processing efficiency.
机译:制造业和服务业的整合已成为主流趋势。在制造过程中,数控机床,作为大规模和复杂的设备,涉及在生命周期中的各种服务需求,尤其是生产性服务需求无数且分散。本文根据集群思路和数学统计理论建立了客户需求与生产服务需求之间的相关模型,以完成CNC机床的生产性服务需求的模块化。提出了综合相关系数模型和改进的AP聚类算法。综合相关系数模型在基于分析层次过程和粗糙集理论获得的组合重量,直接生产服务需求与生产服务需求之间的相关性和生产服务需求的自相关。改进的AP聚类算法是AP和Kruskal最小树原理的组合。通过这种新的算法,可以获得每个客户需求的生产服务需求的聚类项目。最后,通过改进的AP聚类算法,五个矩阵可以在1083?MS,1067〜MS,1149?MS和1042?MS分别计算。然而,原始的AP方法应该花费1122?MS,1241?MS,1231?MS,1383?MS和1231?MS。因此,很明显,改进的AP聚类算法可以提高数据处理效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号