Abstract
Nowadays time series clustering is of great importance in manufacturing industries. Meanwhile, it is considerably challenging to achieve explainable solution as well as significant performance due to computation complexity and variable diversity. To efficaciously handle the difficulty, this paper presents a novel metaheuristic-based time series clustering method which can improve the effectiveness and logicality of existing clustering approaches. The proposed method collects candidate cluster references from hierarchical and partitional clustering through shape-based distance measure as well as dynamic time warping (DTW) on manufacturing time series data. By applying metaheuristics highlighting estimation of distribution algorithms (EDA), such as extended compact genetic algorithm (ECGA), on the collected candidate clusters, advanced cluster centroid combinations with minimal distances can be achieved. ECGA employs the least complicated and the most closely related probabilistic model structure regarding population space during generation cycle. This feature strengthens the comprehension of clustering results in how such optimal solutions were achieved. The proposed method was tested on real-world time series data, open to the public, from manufacturing industry, and showed noticeable performances compared to well-established methods. Accordingly, this paper demonstrates that obtaining both comprehensible result as well as prominent performance is feasible by employing metaheuristic techniques to time series data clustering methods.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bajgar M, Calligaris S, Calvino F, Criscuolo C, Timmis J (2019) Bits and bolts: The digital transformation and manufacturing. OECD Science, Technology and Industry Working Papers, 2019/01, OECD Publishing, Paris
Manyika J, Chui M, Brown B, Bughin J, Dobbs R, Roxburgh C, Hung Byers A (2011) Big data: The next frontier for innovation, competition, and productivity. McKinsey Global Institute, Washington, District of Columbia
Jones MD, Hutcheson S, Camba JD (2021) Past, present, and future barriers to digital transformation in manufacturing: A review. Journal of Manufacturing Systems 60:936–948
Chen H, Chiang RH, Storey VC (2012) Business intelligence and analytics: From big data to big impact. MIS quarterly, 1165-1188
Samek W, Wiegand T, Müller KR (2017) Explainable artificial intelligence: Understanding, visualizing and interpreting deep learning models. arXiv preprint arXiv:1708.08296
Samek W, Müller KR (2019) Towards explainable artificial intelligence. Explainable AI: interpreting, explaining and visualizing deep learning. Springer, Cham, pp 5–22
Aghabozorgi S, Shirkhorshidi AS, Wah TY (2015) Time-series clustering-a decade review. Information Systems 53:16–38
Mehrmolaei S, Keyvanpour MR, Savargiv M (2020) Metaheuristics on time series clustering problem: Theoretical and empirical evaluation. Evolutionary Intelligence, 1-20
Andreopoulos B, An A, Wang X, Schroeder M (2009) A roadmap of clustering algorithms: finding a match for a biomedical application. Briefings in Bioinformatics 10(3):297–314
Liao TW (2005) Clustering of time series data-a survey. Pattern Recognition 38(11):1857–1874
Leng M, Lai X, Tan G, Xu X (2009) Time series representation for anomaly detection. In 2009 2nd IEEE International Conference on Computer Science and Information Technology . IEEE, pp 628–632
Munir M, Siddiqui SA, Dengel A, Ahmed S (2018) DeepAnT: A deep learning approach for unsupervised anomaly detection in time series. Ieee Access 7:1991–2005
Ismail Fawaz H, Forestier G, Weber J, Idoumghar L, Muller PA (2019) Deep learning for time series classification: a review. Data Mining and Knowledge Discovery 33(4):917–963
Katoch S, Chauhan SS, Kumar V (2021) A review on genetic algorithm: past, present, and future. Multimedia Tools and Applications 80(5):8091–8126
Dhiman G (2021) ESA: a hybrid bio-inspired metaheuristic optimization approach for engineering problems. Engineering with Computers 37(1):323–353
David Edward G (1989) Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley
Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press
Ahn CW (2006) Advances in evolutionary algorithms. Springer-Verlag, Berlin Heidelberg
Kennedy J, Eberhart R (1995) Particle swarm optimization. In Proceedings of ICNN’95-international conference on neural networks , vol 4. IEEE, pp 1942–1948
Eberhart RC, Shi Y (1998) Comparison between genetic algorithms and particle swarm optimization. International conference on evolutionary programming. Springer, Berlin, Heidelberg, pp 611–616
Lee S, Soak S, Oh S, Pedrycz W, Jeon M (2008) Modified binary particle swarm optimization. Progress in Natural Science 18(9):1161–1166
Khanesar MA, Teshnehlab M, Shoorehdeli MA (2007) A novel binary particle swarm optimization. In 2007 Mediterranean conference on control & automation . IEEE, pp 1–6
Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In 1997 IEEE International conference on systems, man, and cybernetics. Computational cybernetics and simulation, vol. 5. IEEE, pp 4104–4108
Shabir S, Singla R (2016) A comparative study of genetic algorithm and the particle swarm optimization. International Journal of electrical engineering 9(2016):215–223
Larrañaga P, Lozano JA (Eds.) (2001) Estimation of distribution algorithms: A new tool for evolutionary computation, vol. 2. Springer Science & Business Media
Hauschild M, Pelikan M (2011) An introduction and survey of estimation of distribution algorithms. Swarm and Evolutionary Computation 1(3):111–128
Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Transactions on Evolutionary Computation 3(4):287–297
Baluja S (1994) Population-based incremental learning. a method for integrating genetic search based function optimization and competitive learning. Carnegie-Mellon Univ Pittsburgh Pa Dept Of Computer Science
Jin Y, Oh S, Jeon M (2010) Incremental approximation of nonlinear constraint functions for evolutionary constrained optimization. In IEEE Congress on Evolutionary Computation. IEEE, pp 1–8
Harik G (1999) Linkage learning via probabilistic modeling in the ECGA. IlliGAL report, 99010
Sastry K, Goldberg DE (2000) On extended compact genetic algorithm. In Late-Breaking Paper at the Genetic and Evolutionary Computation Conference pp 352–359
Lanzi PL, Nichetti L, Sastry K, Voltini D, Goldberg DE (2008) Real-coded extended compact genetic algorithm based on mixtures of models. Linkage in evolutionary computation. Springer, Berlin, Heidelberg, pp 335–358
Oh S, Lee S, Jeon M (2009) Evolutionary optimization programming with probabilistic models. In 2009 Fourth International on Conference on Bio-Inspired Computing. IEEE, pp 1–6
Sastry K, Goldberg DE, Johnson DD (2007) Scalability of a hybrid extended compact genetic algorithm for ground state optimization of clusters. Materials and Manufacturing Processes 22(5):570–576
José-García A, Gómez-Flores W (2016) Automatic clustering using nature-inspired metaheuristics: A survey. Applied Soft Computing 41:192–213
Nanda SJ, Panda G (2014) A survey on nature inspired metaheuristic algorithms for partitional clustering. Swarm and Evolutionary Computation 16:1–18
Maulik U, Bandyopadhyay S (2000) Genetic algorithm-based clustering technique. Pattern Recognition 33(9):1455–1465
Thinsungnoen T, Kerdprasop K, Kerdprasop N (2018) Deep autoencoder networks optimized with genetic algorithms for efficient ECG clustering. International Journal of Machine Learning and Computing 8(2):112–116
Shakil M, Fuad Yousif Mohammed A, Arul R, Bashir AK, Choi JK (2022) A novel dynamic framework to detect DDoS in SDN using metaheuristic clustering. Transactions on Emerging Telecommunications Technologies 33(3):e3622
Kadiravan G, Sujatha P, Asvany T, Punithavathi R, Elhoseny M, Pustokhina I, Shankar K (2021) Metaheuristic clustering protocol for healthcare data collection in mobile wireless multimedia sensor networks. Computers, Materials & Continua 66(3):3215–3231
Oh S, Ahn CW (2021) Evolutionary Computation-based Hybird Clustring Technique for Manufacuring Time Series Data. Smart Media Journal 10(3):23–30
Oh S, Suh WH, Ahn CW (2021) Self-Adaptive Genetic Programming for Manufacturing Big Data Analysis. Symmetry 13(4):709
Berndt DJ, Clifford J (1994) Using dynamic time warping to find patterns in time series. In KDD workshop 10(16):359–370
Müller M (2007) Dynamic time warping. Information retrieval for music and motion 69–84
Paparrizos J, Gravano L (2015) K-shape: Efficient and accurate clustering of time series. In Proceedings of the 2015 ACM SIGMOD international conference on management of data. pp 1855–1870
Sardá-Espinosa A (2017) Comparing time-series clustering algorithms in r using the dtwclust package. R package vignette 12:41
Olszewski RT (2001) Generalized feature extraction for structural pattern recognition in time-series data. Carnegie Mellon University
Połap D, Woźniak M (2021) Red fox optimization algorithm. Expert Systems with Applications 166:114–107
Połap D, Woźniak M (2017) Polar bear optimization algorithm: Meta-heuristic with fast population movement and dynamic birth and death mechanism. Symmetry 9(10):203
Fan GF, Yu M, Dong SQ, Yeh YH, Hong WC (2021) Forecasting short-term electricity load using hybrid support vector regression with grey catastrophe and random forest modeling. Utilities Policy 73:101–294
Dong W, Wu J, Zhang X, Bai Z, Wang P, Woźniak M (2022) Improving performance and efficiency of Graph Neural Networks by injective aggregation. Knowledge-Based Systems 254:109–616
Dong W, Wozniak M, Wu J, Li W, Bai Z (2022) De-Noising Aggregation of Graph Neural Networks by Using Principal Component Analysis. IEEE Transactions on Industrial Informatics
Funding
This work was supported by IITP grant funded by the Korea government (MSIT)(No. 2019-0-01842, Artificial Intelligence Gradate School Program (GIST)), and the National Research Foundation of Korea(NRF) funded by the Ministry of Education (NRF-2021R1A2C3013687)
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of Interests
The authors declare no conflict of interest
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Corresponding authors are Sanghoun Oh and Chang Wook Ahn.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Suh, W.H., Oh, S. & Ahn, C.W. Metaheuristic-based time series clustering for anomaly detection in manufacturing industry. Appl Intell 53, 21723–21742 (2023). https://doi.org/10.1007/s10489-023-04594-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-023-04594-5