Exploring distance measures for time series data: A comparative analysis

• Main Author: Lee, Jia Yee
• Format: Final Year Project / Dissertation / Thesis
• Published: 2024
• Subjects: Q Science (General); QA75 Electronic computers. Computer science; T Technology (General)
• Online Access: http://eprints.utar.edu.my/6490/1/LeeJiaYee_Full_Report_Finalised.pdf; http://eprints.utar.edu.my/6490/
• Institution: Universiti Tunku Abdul Rahman

Time series similarity search is a method used to identify the identical pattern within two sets of time series data, finds widespread utility in clustering, anomaly detection, and forecasting. In real-world scenarios, vibration data are often vast, intricate, and noisy, with adjustments in time, amplitude, and phase shifting direct influence on search outcomes. Through a systematic evaluation, various distance measurement methods including Euclidean distance, Dynamic Time Warping, Fast Fourier Transform, Symbolic Aggregate Approximation, and Matrix Profile are performed under diverse conditions such as frequency shifting, amplitude scaling, state change, and noise. The comparative study encompasses not only quantitative assessments of accuracy but also considerations of computational efficiency and robustness. The findings reveal Matrix Profile generally outperforms classic measures like Euclidean distance, Dynamic Time Warping, and Fast Fourier Transform in accuracy, but performs poorly compared to Symbolic Aggregate Approximation. While Matrix Profile exhibits shorter computational time than Symbolic Aggregate Approximation, it slightly extends beyond other classic measures. Thus, Matrix Profile presents competitive advantages among ii distance measurement methodologies. By providing a comprehensive examination of similarity measurement techniques, this study equips the idea for the strength and weaknesses of distance measures, providing valuable insight for decision-making in time series data mining activities.