119
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Study on typical process route mining method based on multilevel longest common subsequence information entropy and intelligent clustering model

ORCID Icon
Pages 1416-1430 | Received 26 Jun 2022, Accepted 30 Jan 2023, Published online: 10 Feb 2023

References

  • Baba, K., T. Nakatoh, and T. Minami. 2017. “Plagiarism Detection Using Document Similarity Based on Distributed Representation.” Procedia computer science 111: 382–387. doi:10.1016/j.procs.2017.06.038.
  • Berger, B., M. S. Waterman, and Y. W. Yu. 2021. “Levenshtein Distance, Sequence Comparison and Biological Database Search.” IEEE Transactions on Information Theory 67 (6): 3287–3294. doi:10.1109/TIT.2020.2996543.
  • Blum, C., M. Djukanovic, A. Santini, H. Jiang, C. M. Li, F. Manya, and G. R. Raidl. 2021. “Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem.” Computers & Operations Research 125: 105089. doi:10.1016/j.cor.2020.105089.
  • Cheng, F., and C. Shao. 2020. “Research on Artificial Fish Swarm Clustering Algorithm in Urban Internet of Vehicles.” In Proceedings of IEEE International Conference on Smart Internet of Things, Beijing, China, 328–332.
  • Fan, W., Y. Zhang, L. Wang, and S. Zhong. 2018. “Typical Machining Process Mining of Servo Valve Parts Based on Self-Adaptive Affinity Propagation Clustering.” In Proceedings IEEE International Computers, Signals and Systems Conference, Dalian, China, 674–678.
  • Hartigan, J. A., and M. A. Wong. 1979. “Algorithm as 136: A K-Means Clustering Algorithm.” Journal of the Royal Statistical Society 28 (1): 100–108. doi:10.2307/2346830.
  • Hirschberg, D. S., and S. Daniel. 1977. “Algorithms for the Longest Common Subsequence Problem.” Journal of the ACM 24 (4): 664–675. doi:10.1145/322033.322044.
  • Kambhampati, S. 1990. “Mapping and Retrieval During Plan Reuse: A Validation Structure Based Approach.” In Proceedings of the eighth National conference on Artificial intelligence, Boston, USA, 170–175.
  • Li, C. 2022. “A Novel Framework for Discovery and Reuse of Typical Process Route Driven by Symbolic Entropy and Intelligent Optimisation Algorithm.” PLoS One 17 (9): e0274532. doi:10.1371/journal.pone.0274532.
  • Li, C., L. Li, and X. Wang. 2021. “Similarity Measurement of the Geometry Variation Sequence of Intermediate Process Model.” Journal of Mechanical Science and Technology 35 (7): 3089–3100. doi:10.1007/s12206-021-0631-z.
  • Li, C., R. Mo, Z. Chang, H. Yang, N. Wan, and Y. Xiang. 2017. “A Multifactor Decision-Making Method for Process Route Planning.” International Journal of Advanced Manufacturing Technology 90 (5): 1789–1808. doi:10.1007/s00170-016-9502-7.
  • Li, C. L., R. Mo, Z. Y. Chang, D. Zhang, and Y. Xiang. 2015. “Multi-Dimensional Manufacturing Information Based Typical Product Process Route Discovery Method.” Journal of Mechanical Engineering 51 (15): 148–157. doi:10.3901/JME.2015.15.148.
  • Liu, S., Z. Zhang, and X. Tian. 2007. “A Typical Process Route Discovery Method Based on Clustering Analysis.” International Journal of Advanced Manufacturing Technology 35 (1–2): 186–194. doi:10.1007/s00170-006-0706-0.
  • Mehzad, N., K. Asghari, and M. R. Chamani. 2020. “Application of Clustered-NA-ACO in Three-Objective Optimization of Water Distribution Networks.” Urban Water Journal 17 (1): 1–13. doi:10.1080/1573062X.2020.1734633.
  • Nasiri, J., and F. M. Khiyabani. 2018. “A Whale Optimization Algorithm (WOA) Approach for Clustering.” Cogent Mathematics & Statistics 5 (1): 1483565. doi:10.1080/25742558.2018.1483565.
  • Palunčić, F., H. C. Ferreira, T. G. Swart, and W. A. Clarke. 2010. “Modelling Distances Between Genetically Related Languages Using an Extended Weighted Levenshtein Distance.” Southern African Linguistics & Applied Language Studies 27 (4): 381–389. doi:10.2989/SALALS.2009.27.4.2.1022.
  • Peng, W. P., T. Zhang, Q. H. Zhang, and S. W. Ni. 2019. Mining and Analyzing Process Similarity of Product Module for DPIPP Based on PLM Database.” In Proceedings of IOP Conference Series: Materials Science and Engineering, Geelong, Australia, 627:012004.
  • Perepu, P. K. 2021. “OpenMp Implementation of Parallel Longest Common Subsequence Algorithm for Mathematical Expression Retrieval.” Parallel Processing Letters 31 (2): 2150007. doi:10.1142/S0129626421500079.
  • Sammouda, R., and A. El-Zaart. 2021. “An Optimized Approach for Prostate Image Segmentation Using K-Means Clustering Algorithm with Elbow Method.” Computational Intelligence and Neuroscience 2021: 4553832. doi:10.1155/2021/4553832.
  • Temurnikar, A., P. Verma, and G. Dhiman. 2022. “A PSO Enable Multi-Hop Clustering Algorithm for VANET.” International Journal of Swarm Intelligence Research 13 (2): 1–14. doi:10.4018/IJSIR.20220401.oa7.
  • Wu, Z., W. Liu, W. Zheng, W. Nie, and Z. Li. 2021. “Manufacturing Process Similarity Measurement Model and Application Based on Process Constituent Elements.” International Journal of Production Research 59 (14): 4205–4227. doi:10.1080/00207543.2020.1759838.
  • Zhang, H., L. M. Qiu, S. Y. Zhang, and X. X. Hu. 2013. “Typical Product Process Route Extraction Method Based on Intelligent Clustering Analysis.” Computer Integrated Manufacturing Systems 19 (3): 490–498.
  • Zhao, Y. P., and X. L. Zhou. 2021. “K-Means Clustering Algorithm and Its Improvement Research.” Journal of Physics Conference Series, Nanjing, China, 1873(1):012074.
  • Zhou, D. C. 2015. “Typical Process Route Discovery Method Based on Granular Computing and Sequence Alignment.” Computer Integrated Manufacturing Systems 21 (3): 694–701.
  • Zhou, D., and X. Dai. 2015. “A Method for Discovering Typical Process Sequence Using Granular Computing and Similarity Algorithm Based on Part Features.” International Journal of Advanced Manufacturing Technology 78 (9–12): 1781–1793. doi:10.1007/s00170-014-6772-9.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.