Typical process route discovery method based on multi-dimensional fusion similarity calculation and Markov clustering
Source abstract
Abstract
In the era of knowledge economy and intelligent manufacturing, a large number of process cases and data accumulated by manufacturing enterprises have become valuable assets of enterprises. Effective mining and high-quality reuse of these cases is an important way to improve the efficiency of product development and carry out design and manufacturing process innovation. In reality, the first task is to determine the typical process with high representativeness and reusability in the process case database so as to realize efficient mining and reuse of the manufacturing process cases accumulated by enterprises. In order to scientifically determine the typical process, this paper proposes a typical process route discovery method based on multi-dimensional fusion similarity calculation and Markov clustering. From the perspective of the longest subsequence with the same sequence in the process route and the calling frequency of the process method, this method proposes the order measurement method and the disorder measurement method of the similarity between the process routes. Furthermore, by means of the coefficient of variation, the results of the order measurement and the disorder measurement of the similarity between process routes are fused, and the calculation of the fusion similarity value between process routes is realized. Finally, with the help of the idea of spectral clustering and the extracted cluster centers, the typical process routes are mined for reuse. Finally, based on three validation examples, it is shown that the proposed method can realize effective mining of high-value process reuse objects, which, in turn, can support manufacturing instance reuse more.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Digital Transformation in Industry · Manufacturing Process and Optimization · Flexible and Reconfigurable Manufacturing Systems
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Shaanxi Key Laboratory of Advanced Manufacturing and Evaluation of Robot Key Components, Baoji University of Arts and Sciences 1 , Baoji 721016,
School of Robot Engineering, Wenzhou University of Technology 2 , Wenzhou 325025,
References (25)
Show source-provided references
1. A typical process route discovery method based on clustering analysis10.1007/s00170-006-0706-0 ↗
2. Typical product process route extraction method based on intelligent clustering analysis10.13196/j.cims.2013.03.44.zhangh.021 ↗
3. A method for discovering typical process sequence using granular computing and similarity algorithm based on part features10.1007/s00170-014-6772-9 ↗
4. Multi-dimensional manufacturing information based typical product process route discovery method10.3901/jme.2015.15.148 ↗
5. A novel framework for discovery and reuse of typical process route driven by symbolic entropy and intelligent optimisation algorithm10.1371/journal.pone.0274532 ↗
6. Study on typical process route mining method based on multilevel longest common subsequence information entropy and intelligent clustering model10.1080/0951192X.2023.2177745 ↗
7. Grouping part/product variants based on networked operations sequence10.1016/j.jmsy.2015.10.005 ↗
8. A similarity-based hierarchical clustering method for manufacturing process models10.3390/su11092560 ↗
9. A comprehensive approach to operation sequence similarity based part family formation in the reconfigurable manufacturing system10.1080/00207543.2012.701771 ↗
10. Manufacturing process similarity measurement model and application based on process constituent elements10.1080/00207543.2020.1759838 ↗
11. A novel typical networked process route discovery approach based on networked sequence similarity and intelligent clustering10.1016/j.jmsy.2025.10.015 ↗
12. Algorithm as 136: A k-means clustering algorithm10.2307/2346830 ↗
13. Particle swarm optimization based on K-means clustering and adaptive dual-groups strategy10.1016/j.swevo.2025.102226 ↗
14. Clustering with K-means hybridization ant colony optimization (K-ACO)10.30495/ijm2c.2022.1953867.1249 ↗
15. PSO and K-means-based semantic segmentation toward agricultural products10.1016/j.future.2021.06.059 ↗
16. A detection method for false data injection attacks in power systems based on artificial fish swarm K-means clustering algorithm
17. Algorithms for the longest common subsequence problem10.1145/322033.322044 ↗
18. OpenMP implementation of parallel longest common subsequence algorithm for mathematical expression retrieval10.1142/s0129626421500079 ↗
19. Solving longest common subsequence problems via a transformation to the maximum clique problem10.1016/j.cor.2020.105089 ↗
20. Distributionally robust stochastic optimization with Wasserstein distance10.1287/moor.2022.1275 ↗
21. Measuring association with Wasserstein distances10.3150/21-bej1438 ↗
22. Fast Markov clustering algorithm based on belief dynamics10.1109/tcyb.2022.3141598 ↗
23. Module overlapping structure detection in PPI using an improved link similarity-based Markov clustering algorithm10.1007/s00521-018-3508-z ↗
24. A tutorial on spectral clustering10.1007/s11222-007-9033-z ↗
25. Multi-view spectral clustering via constrained nonnegative embedding10.1016/j.inffus.2021.09.009 ↗