English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 118786/149850 (79%)
Visitors : 82369118      Online Users : 73
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 學位論文 >  Item 140.119/158366
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/158366


    Title: 時間序列之相似度評估:振幅、時間與雜訊影響之探討
    Similarity Evaluation of Time Series: An Investigation on the Effects of Amplitude, Time, and Noise
    Authors: 黃瑞華
    Huang, Jui-Hua
    Contributors: 蔡炎龍
    Tsai, Yen-Lung
    黃瑞華
    Huang, Jui-Hua
    Keywords: 時間序列相似度
    模糊局部離群因子
    時間軸交叉比
    值域均分
    模糊相似度
    Time series similarity
    Fuzzy Local Outlier Factor
    Time-Axis Cross Ratio
    Range Equally Divided
    Fuzzy similarity
    Date: 2025
    Issue Date: 2025-08-04 13:10:03 (UTC+8)
    Abstract: 時間序列相似度評估在金融、醫療與工業監控等領域中至關重要,但常因振幅與時間尺度變異,以及雜訊干擾,傳統相似度衡量方法常面臨準確性與穩健性不足之挑戰。特別是振幅離群點、時間軸錯位(如時間偏移與均勻伸縮),以及振幅變動(如振幅偏移、均勻伸縮與加性雜訊) 等因素,皆可能嚴重扭曲時間序列間的相似關係。
    本研究針對上述問題,提出一套三階段整合之時間序列相似度評估方法,涵蓋三項核心演算法:模糊局部離群因子(Fuzzy Local Outlier Factor, FLOF)、時間軸交叉比(Time-Axis Cross Ratio, TACR)與值域均分(Range Equally Divided, RED),分別對應於振幅離群值檢測、時間軸校正與振幅變異處理。此方法兼顧精準性與運算效率,顯著提升相似度計算對異常值、時間錯位與振幅失真的抵抗能力。
    首先,FLOF將傳統的局部離群因子概念結合模糊邏輯與局部密度估計,為每個資料點賦予離群程度的模糊隸屬度(而非二元的離群標記)。並透過分析滑動視窗大小與離群強度指標對局部密度偏差的影響,藉以量化離群點的嚴重程度。演算法進一步以非離群點模糊隸屬度的補數作為權重對離群點進行插值替補,從而在消除異常值的同時保留序列原有的趨勢。此方法有效去除異常峰值並維持時間序列的構造完整性。透過預先清除振幅離群點,FLOF 提升了相似度評估的穩健性。其可調參數機制使之可適應高頻波動、季節性週期、高雜訊等各類常見時間序列數據環境。實驗結果顯示,FLOF 能準確找出真實離群點且不對正常資料過度校正,是一種可靠的時間序列資料預處理方法。
    其次,TACR演算法專為校正時間偏移(TS)和時間均勻伸縮(TUS)所導致的序列錯位問題。該方法採用三個步驟處理:首先對序列進行平滑處理以降低雜訊;再擷取序列中的局部極值點以構成代表形態的特徵序列;最終透過二序列極值點位置的交叉比(Cross Ratio)推估,並校正時間軸之伸縮比例與偏移量。由極值間距算得的交叉比是一種射影不變量,可直接推斷觀察序列相對查詢序列所需的時間伸縮因子和偏移量。依據這些參數調整觀察序列的時間軸,TACR得以精確對齊兩序列中對應事件的時間位置。相較於動態時間校正(DTW)等需要高計算量的傳統對齊方法,TACR僅利用局部極值等少量特徵點進行計算,大幅降低了時間複雜度。因而TACR在處理大規模資料時具備極高的效率。同時,由於對齊是以顯著特徵為基礎,而非對整個序列任意拉伸變形,序列整體的形態特徵得以保留。實驗分析顯示,TACR能以極小誤差復原各種時間差異(例如20% 的時間壓縮或拉伸,以及固定的時間延遲),確保結構相似的序列得到正確對齊。透過消除非同步或時間尺度不一致造成的偏差,此方法顯著提升了後續相似度計算的可靠性。
    最後,RED演算法以抗振幅變異為核心,處理振幅偏移(AS)、振幅均勻伸縮(AUS)和振幅加性雜訊(AAN)等問題。該方法透過將時間序列的數值範圍等間距地劃分為多個區間,並將資料點映射為符號表示,RED將序列轉換為對線性振幅變化不敏感的形式。在經FLOF與TACR預處理(離群值已移除、時間對齊且長度一致)後,將查詢序列與觀察序列的數值依其所屬的區間轉換為符號序列。進一步引入模糊邏輯,為對應時間點之離散值配對定義相似度的模糊隸屬函數,經由此模糊的符號轉換,即使兩序列絕對振幅不同,但只要形狀趨勢相同,其符號化後的模式也會高度相似。因此,峰谷等特徵將以不受絕對值影響的方式表達,確保即使存在固定偏移或均勻伸縮也不改變其形態表示。接著,RED計算兩個符號序列之間的模糊相似度,亦即比較它們的形狀特徵而忽略振幅差異。此方法在各種振幅條件下均能有效維持真正的模式相似性:對於形狀相同但量值不同,或含有中等雜訊的序列,使用RED所得到的模糊相似度仍能維持高準確性,有效維持序列形狀特徵的穩定表徵。測試顯示,即便序列經歷顯著的振幅平移、縮放及雜訊擾動,RED仍可將處理後的序列與原序列之相似度維持在0.97以上,展現出優異的抗雜訊能力與振幅不變性。透過著重比較振幅的相對分佈與排序,而非依賴平均值等整體統計量,RED降低了振幅與雜訊的影響,在消除振幅失真偏差的同時提供了穩健的最終相似度量。
    綜合三項演算法,本研究建構一套完整且高效的FLOF-TACR-RED相似度評估框架,並透過系統化實驗加以驗證。測試資料涵蓋了具有代表性的合成時間序列模式(如「頭肩頂」形態及其他股價圖形型態),模擬各類變異情境。首先,在振幅離群干擾測試中,針對原始序列加入不同比例(0%、5%、10%)的離群點,FLOF演算法均成功偵測並校正了離群點:在無離群值的情況下(0%)完全保留了序列結構,在離群點佔10%的高度污染情境下,仍有效清除離群而無錯判,且未破壞原有結構。其次,在時間軸變化測試中,對序列施加了設定的偏移與伸縮(例如偏移5%~20% 的長度、時間軸壓縮至0.8倍或拉伸至1.2倍),TACR能準確估計出目標的偏移量與伸縮比例,使經校正後的序列之主要峰谷與原序列在時間上精確對齊。再次,在振幅變動與雜訊測試中,對序列加入固定基線偏移、最高±20%的整體振幅伸縮,以及均值為0、標準差達0.1的高斯雜訊;RED演算法處理後的序列與原始序列之模糊相似度皆維持在 0.97 以上,顯示儘管存在這些振幅與雜訊擾動,序列的相似性幾乎未受到影響。
    此外,本研究亦將上述三階段方法與現有技術如局部極值動態時間扭曲(Locally Elastic Dynamic Time Warping, LE-DTW)技術進行對照。結果顯示,在同時存在離群點、時間錯位、振幅伸縮與雜訊的情境下,整合的FLOF-TACR-RED方法在所有測試案例中均顯著優於LE-DTW。LE-DTW所輸出之距離度量在這些變異因素的影響下易受到嚴重扭曲(例如在某測試模式中,僅引入輕微變異便導致LE-DTW計算的距離值飆升四倍以上);相對之下,對於相同受擾序列,所提方法依然維持極高的相似度(模糊相似度≥ 0.98)。在四種不同圖形型態及多種組合干擾條件下,整合方法皆取得接近1.0的相似度分數,幾乎完全還原了序列之原始結構相似性。這些結果證實,所提出的各演算法(特別是結合運用時)大幅增強了時間序列相似度評估的穩健性。透過濾除振幅離群、校正時間錯位、抵消振幅差異,FLOF-TACR-RED 方法得以保留傳統方法在嚴苛條件下難以捕捉的序列真實相似關係。
    總而言之,本研究提出了一套全面的解決方案,以改善在各種振幅與時間扭曲及雜訊干擾下的時間序列相似度評估。所提出的三種新穎演算法各自針對特定的變異類型,並集成形成一個高效的預處理與評估框架。透過系統性的理論推導與實驗驗證,本研究證明此整合方法相較傳統技術能夠提供更可靠且精確的相似度評估,大幅提升了對離群點、錯位與雜訊的抵抗力。研究成果不僅為時間序列分析提供了新的方法論見解,也對現實應用具有實際意義。無論是金融趨勢分析、生醫訊號比對,或工業感測監控,穩健的相似度量都是決策分析的關鍵,有賴於本研究所提出的方法來加以強化。
    Similarity evaluation for time series data is crucial in finance, healthcare, and industrial monitoring domains. However, traditional similarity measurement methods often struggle with accuracy and robustness due to variations in amplitude and time scale and noise interference. Specifically, factors such as amplitude outliers, time-axis distortions (e.g., time shifts and uniform scaling), and amplitude transformations (e.g., shifts, scaling, and additive noise) can severely distort the perceived similarity between time series.
    This study proposes an integrated three-stage similarity evaluation framework for time series data to address these challenges. It incorporates three core algorithms: Fuzzy Local Outlier Factor (FLOF), Time-Axis Cross Ratio (TACR), and Range Equally Divided (RED), which respectively handle amplitude outlier detection, temporal alignment, and amplitude variation correction. This framework balances precision and computational efficiency, significantly improving the resilience of similarity evaluation against outliers, time misalignments, and amplitude distortions.
    FLOF extends the classical Local Outlier Factor (LOF) by incorporating fuzzy logic and local density estimation, assigning each data point a fuzzy degree of outlierness rather than a binary label. The algorithm quantifies the severity of anomalies by analyzing the impact of sliding window size and outlier strength indicators on local density deviations. Non-outlier points are then used to interpolate and replace outliers, weighted by the complement of their fuzzy membership values, effectively removing outliers while preserving the trend of the original sequence. This approach eliminates extreme peaks and maintains structural integrity, enhancing the robustness of subsequent similarity assessments. FLOF's adjustable parameters allow it to adapt to high-frequency fluctuations, seasonality, and high-noise environments. Experimental results confirm its precision in detecting true outliers without over-correcting clean data, making it a reliable preprocessing method for time series.
    TACR, on the other hand, targets the correction of time shifts (TS) and uniform time scaling (TUS), which often cause misalignments. It operates in three steps: smoothing the sequence to reduce noise, extracting local extrema as representative features, and estimating scale and shift parameters based on the cross-ratio of extrema positions. Cross-ratios of interval lengths between extrema ”projective invariants” are used to calculate the required time-axis transformation. TACR aligns sequences based on key shape-defining features rather than warping the entire sequence, preserving the global shape and reducing computation. Compared to traditional approaches like Dynamic Time Warping (DTW), TACR is significantly more efficient and accurate in estimating 20% time compressions/stretching and fixed offsets. By correcting time-scale inconsistencies and misalignments, TACR significantly improves the reliability of similarity evaluations.
    The RED algorithm addresses amplitude-related issues, including amplitude shift (AS), uniform scaling (AUS), and additive noise (AAN). It divides the value range into equal intervals and converts data points into symbolic representations, making the sequence less sensitive to linear amplitude variations. After preprocessing with FLOF and TACR (removing outliers, aligning time axes, and unifying sequence length), the query and reference sequences are transformed into symbolic sequences based on interval mapping. Fuzzy logic is applied to define membership-based similarity functions between corresponding symbols. Thus, even if the absolute amplitudes differ, similar trends and shapes yield highly comparable symbolic representations. Peaks and valleys are encoded in a distortion-invariant manner. The final fuzzy similarity metric focuses on shape characteristics rather than raw amplitudes. Experimental results show that RED maintains similarity scores above 0.97 despite amplitude shifts, scaling up to ±20%, and Gaussian noise with σ = 0.1. This demonstrates RED's effectiveness in preserving shape similarity under amplitude and noise disturbances. RED offers robustness and reliable similarity metrics by focusing on relative amplitude distribution and rank instead of global statistics like mean.
    Combining these three algorithms, this study develops a comprehensive and efficient FLOF-TACR-RED similarity evaluation framework validated through systematic experiments. The experiments simulate various distortion scenarios using representative synthetic time series patterns (e.g., Head & Shoulders and other stock chart motifs). Under amplitude outlier conditions, sequences with 0%, 5%, and 10% outliers were tested. FLOF accurately identified and corrected outliers, preserving structure in clean sequences and eliminating up to 10% contamination without false positives. In time-axis variation tests (5%–20% shifts, scaling from 0.8x to 1.2x), TACR correctly estimated offsets and scaling factors, aligning key features in time. In amplitude and noise tests (fixed AS, AUS of ±20%, and Gaussian noise with σ = 0.1), RED maintained fuzzy similarity scores above 0.97, showing minimal impact from amplitude disturbances.
    The integrated FLOF-TACR-RED approach was benchmarked against existing methods, such as Locally Elastic Dynamic Time Warping (LE-DTW). The results show that under combined distortions: outliers, time misalignment, amplitude changes, and noise, FLOF-TACR-RED consistently outperforms LE-DTW. Sometimes, minor distortions caused LE-DTW distances to quadruple, while the proposed method maintained fuzzy similarity scores ≥ 0.98. Across four shape types and multiple perturbation conditions, the proposed method consistently yielded similarity scores near 1.0, effectively recovering structural similarity. These findings confirm that the proposed algorithms (especially when integrated) significantly enhance the robustness of time series similarity evaluation. By removing outliers, aligning time, and normalizing amplitude, FLOF-TACR-RED reveals true underlying similarities that traditional methods often miss under noisy conditions.
    In conclusion, this study offers a comprehensive solution to evaluating time series similarity under amplitude and time distortions and noise. The three novel algorithms, each targeting a specific type of variation, form a unified preprocessing and evaluation framework. Through rigorous theoretical formulation and experimental validation, the proposed method outperforms traditional techniques regarding reliability and precision. These results have practical significance for real-world applications, from financial trend analysis and biomedical signal matching to industrial monitoring, where robust similarity measures are critical for informed decision-making.
    Reference: [1] Y. Liu, Y. Chang, X. Jiang, H. Mei, Y. Cao, D. Wu, R. Xie, W. Jiang, E. Vasquez, Y. Wu, S. Lin, and Ya. Cao, “Analysis of the role of PANoptosis in seizures via integrated bioinformatics analysis and experimental validation,” Heliyon, 10(4), e26219, 2024, pp. 1-15.
    [2] G. E. P. Box, G. M. Jenkins, G. C. Reinsel, and G. M. Ljung, Time Series Analysis: Forecasting and Control, John Wiley & Sons, 2015.
    [3] G. D. Clifford, C. Liu, B. Moody, L. H. Lehman, I. Silva, and Q. Li, “AF classification from a short single lead ECG recording: The PhysioNet/Computing in cardiology challenge 2017,” in Proceeding of 2017 Computing in Cardiology (CinC), Rennes, France, 2017, pp. 1-4.
    [4] E. Keogh and S. Kasetty. “On the need for time series data mining benchmarks: A survey and empirical demonstration,” in Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge, 2003, pp. 102-111.
    [5] T. Rakthanmanon, B. Campana, A. Mueen, G. Batista, M. B. Westover, Q. Zhu, and E. Keogh, “Searching and mining trillions of time series subsequences under dynamic time warping,” in Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012, pp. 262-270.
    [6] H. Ding, G. Trajcevski, P. Scheuermann, X. Wang, and E. Keogh, “Querying and mining of time series data: Experimental comparison of representations and distance measures,” in Proceedings of the VLDB Endowment, 1(2), 2008, pp. 1542-1552.
    [7] S. Salvador and P. Chan, “Toward accurate dynamic time warping in linear time and space,” Intelligent Data Analysis, 11(5), 2007, pp. 561-580.
    [8] A. Bagnall, J. Lines, A. Bostrom, J. Large, and E. Keogh, “The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances,” Data Mining and Knowledge Discovery, 31(3), 2017, pp. 606-660.
    [9] A. Abanda, U. Mori, and J. A. Lozano, “A review on distance based time series classification,” Data Mining and Knowledge Discovery, 33(2), 2018, pp. 378-412.
    [10] D. J. Berndt and J. Clifford, “Using dynamic time warping to find patterns in time series,” in Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, 1994, pp. 359-370.
    [11] Y. Bai, M. Zhao, R. Li, and P. Xin, “A new data mining method for time series in visual analysis of regional economy,” Information Processing and Management, 59(1), 102741, 2021, pp. 1-15.
    [12] S. Zavrak and M. Iskeyeli, “Flow-based intrusion detection on software-defined networks: A multivariate time series anomaly detection approach,” Neural Computing and Applications, 35(16), 2023, pp. 12175-12193.
    [13] F. Montefusco, A. Procopio, and D. G. Bates, “Scalable reverse-engineering of gene regulatory networks from time-course measurements,” International Journal of Robust and Nonlinear Control, 33(9), 2023, pp. 5023-5038.
    [14] R. B. Simpson, A. V. Kulinkina1, and E. N. Naumova, “Investigating seasonal patterns in enteric infections: a systematic review of time series methods,” Epidemiology and Infection, 150, e50, 2022, pp. 1–13.
    [15] K. Fanga, D. Kifer, K. Lawson, D. Feng, and C. Shen, “The data synergy effects of time-series deep learning models in hydrology,” Water Resources Research, 58(4), 2022, pp. 1-18.
    [16] T. Fu, “A review on time series data mining,” Engineering Applications of Artificial Intelligence, 24(1), 2011, pp. 164-181.
    [17] P. Esling and C. Agon, “Time-series data mining,” ACM Computing Surveys, 45(1), Article 12, 2012, pp. 1–34
    [18] J. Lu and S. Yi, “Reducing overestimating and underestimating volatility via the augmented blending-ARCH model,” Applied Economics and Finance, 9(2), 2022, pp. 48-59.
    [19] P. D’Urso, L. De Giovanni, and R. Massari, “Trimmed fuzzy clustering of financial time series based on dynamic time warping,” Annals of Operations Research, 299(1), 2021, pp. 1379–1395.
    [20] T. Kieu, B. Yang, C. Guo, and C. S. Jensen, “Outlier detection for time series with recurrent autoencoder ensembles,” in Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19). 2019, pp. 2725-2732.
    [21] M. M. Hamed, M. S. Nashwan, and S. Shahid, “Performance evaluation of reanalysis precipitation products in Egypt using fuzzy entropy time series similarity analysis,” International Journal of Climatology, 14(11), 2021, pp. 5431-5446.
    [22] S. Li, X. Jin, Y. Xuan, X. Zhou, W. Chen, Y.-X. Wan, and X. Yan, “Enhancing the locality and breaking the memory bottleneck of transformer on time series forecasting,” in Proceeding of the 33rd Conference on Neural Information Processing Systems, Vancouver, Canada, 2019, pp. 1-12.
    [23] G. Chatzigeorgakidis, D. Skoutas, K. Patroumpas, T. Palpanas, S. Athanasiou, and S. Skiadopoulos, “Local similarity search on geolocated time series using hybrid indexing,” in Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 5-8 November 2019, pp. 179-188.
    [24] H. A. Dau, A. Bagnall, K. Kamgar, C. C. M. Yeh, Y. Zhu, S. Gharghabi, C. A. Ratanamahatana, and E. Keogh, “The UCR time series archive,” Journal of Automatica Sinica, 6(6), November 2019, pp. 1293-1305.
    [25] R. Tavenard, J. Faouzi, G. Vandewiele, F. Divo, G. Androz, C. Holtz, M. Payne, R. Yurchak, M. Rußwurm, K. Kolar, and E. Woods, “Tslearn: A machine learning toolkit for time series data,” The Journal of Machine Learning Research, 21(1), Article No.118, 2020, pp. 4686–4691.
    [26] M. Liang, R. W. Liu, S. Li, Z. Xiao, X. Liu, and F. Lu, “An unsupervised learning method with convolutional auto-encoder for vessel trajectory similarity computation,” Ocean Engineering, 225(1), 108803, April 2021, pp. 1-16.
    [27] G. E. A. P. A. Batista, E. J. Keogh, O. M. Tataw, and V. M. A. de Souza, “CID: an efficient complexity-invariant distance for time series,” Data Mining and Knowledge Discovery, 28, 2014, pp. 634–669.
    [28] A. D. Livera, R. J. Hyndman, and R. D. Snyder, “Forecasting time series with complex seasonal patterns using exponential smoothing,” Journal of the American Statistical Association. 106(496), 2011, pp. 1513-1527.
    [29] Y. Wang, X. Du, Z. Lu, Q. Duan, and J. Wu, “Improved LSTM-based time-series anomaly detection in rail transit operation environments,” IEEE Transactions on Industrial Informatics, 18(12), 2022, pp. 9027-9035.
    [30] K. Choi, J. Yi, C. Park, and S. Yoon, “Deep learning for anomaly detection in time-series data: review, analysis, and guidelines,” IEEE Access, 9, pp. 120043-120063.
    [31] P. C. Austin and S. van Buuren, “The effect of high prevalence of missing data on estimation of the coefficients of a logistic regression model when using multiple imputation,” BMC Medical Research Methodology, 22(196), 2022, pp. 1-14.
    [32] M. Llamedo and J. P. Martinez, “Heartbeat classification using feature selection driven by database generalization criteria,” IEEE Transactions on Biomedical Engineering, 58(3), 2011, pp. 616-625.
    [33] A. Aue and L. Horváth, “Structural breaks in time series,” Journal of Time Series Analysis, 34(1), 2013, pp. 1-16.
    [34] H. Sakoe and S. Chiba, “Dynamic programming algorithm optimization for spoken word recognition,” IEEE Transactions on Acoustics, Speech, and Signal Processing, 26(1), 1978, pp. 43-49.
    [35] X. Wang, A. Mueen, H. Ding, G. Trajcevski, E. Keogh, and W. Shu, “Experimental comparison of representation methods and distance measures for time series data,” Data Mining and Knowledge Discovery, 26(2), 2013, pp. 275-309.
    [36] L. R. Rabiner, “A tutorial on hidden Markov models and selected applications in speech recognition,” Proceedings of the IEEE, 77(2), 1989, pp. 257-286.
    [37] K. Simonyan and A. Zisserman, “Two-stream convolutional networks for action recognition in videos,” Advances in Neural Information Processing Systems, 27, 2014, pp. 568-576.
    [38] D. P. W. Ellis and G. E. Poliner, “Identifying cover songs with chroma features and dynamic programming beat tracking,” IEEE Transactions on Audio, Speech, and Language Processing, 16(2), 2007, pp. 372-381.
    [39] Task Force of the European Society of Cardiology and the North American Society of Pacing and Electrophysiology, “Heart rate variability: standards of measurement, physiological interpretation, and clinical use,” Circulation, 93(5), 1996, pp.1043-1065.
    [40] G. D. Clifford, F. Azuaje, and P. McSharry, Advanced Methods and Tools for ECG Data Analysis, Artech House, Inc., 2006.
    [41] P. Senin. Dynamic Time Warping Algorithm Review, Tech. Report, Information and Computer Science Department University of Hawaii at Manoa Honolulu, USA, 2008.
    [42] S. G. Mallat. “A theory for multiresolution signal decomposition: the wavelet representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(7), 1989, pp..674-693.
    [43] M. J. Menne, C. N. Williams, and R. S. Vose, “The U.S. historical climatology network monthly temperature data, version 2,” Bulletin of the American Meteorological Society, 90(7), 2009, pp. 993-1007.
    [44] W. E. Diewert, “Hedonic regressions: review of some unresolved issues” in Proceeding of the 7th meeting of the Ottawa Group, Paris, May 2003. pp. 1-43.
    [45] G. B. Moody and R. G. Mark, “The impact of the MIT-BIH arrhythmia database,” IEEE Engineering in Medicine and Biology Magazine, 20(3), 2011, pp. 45-50.
    [46] S. Mallat, A Wavelet Tour of Signal Processing, Elsevier. 1999.
    [47] R. Radhakrishnan, A. Divakaran, and P. Smaragdis, “Audio analysis for surveillance applications,” in Proceeding of the IEEE Workshop on Applications of Signal Processing to Audio and Acoustics. October 16-19, 2005, pp. 158-161.
    [48] C. A. Ratanamahatana and E. Keogh, “Three myths about dynamic time warping data mining,” in Proceedings of the 2005 SIAM International Conference on Data Mining, 2005, pp. 506-510.
    [49] R. J. Hyndman and G. Athanasopoulos, Forecasting: Principles and Practice, OTexts, 2018.
    [50] R. Cont, “Empirical properties of asset returns: stylized facts and statistical issues,” Quantitative Finance, 1(2), 2001, pp. 223-236.
    [51] E. J. Keogh and M. J. Pazzani, “An enhanced representation of time series which allows fast and accurate classification, clustering, and relevance feedback,” in Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, 1998, pp. 239-243.
    [52] D. Q. Goldin and P. C. Kanellakis, “On similarity queries for time-series data: constraint specification and implementation,” in Proceeding of the International Conference on Principles and Practice of Constraint Programming, 1995, pp.137–153.
    [53] R. Agrawal, K. Lin, H. S. Sawhney, and K. Shim, “Fast similarity search in the presence of noise, scaling, and translation in time series,” in Proceedings of the 2lst VLDB Conference, Ziiricb, Switzerland. 1995, pp. 490-510.
    [54] G. Das, D. Gunopulos, and H. Mannila, “Finding similar time series,” in Proceeding of the 1st European Symposium on Principles of Data Mining and Knowledge Discovery, 1997, pp. 88–100.
    [55] E. Keogh and P. Smyth, A Probabilistic Approach to Fast Pattern Matching in Time Series Databases, AAAI Technical Report WS-98-07, 1998.
    [56] K. K. W. Chu and M. H. Wong, “Fast time-series searching with scaling and shifting,” in Proceedings of ACM Principles on Database Systems, Philadelphia, PA, 1999, pp. 237–248.
    [57] R. J. Alcock and Y. Manolopoulos, “Time-series similarity queries employing a feature-based approach,” in Proceeding of the 7th Hellenic Conference on Informatics, 1999, pp. 27-29.
    [58] D. Rafiei and A. O. Mendelzon, “Querying time series data based on similarity,” IEEE Transactions on Knowledge and Data Engineering, 12(5), 2000, pp. 675-693.
    [59] E. Keogh, S. Chu, D. Hart, and M. Pazzani, “An online algorithm for segmenting time series,” in Proceeding of the IEEE International Conference on Data Mining, 2001, pp. 289-296.
    [60] E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra, “Dimensionality reduction for fast similarity search in large time series databases,” Knowledge and Information Systems, 3, 2001, pp.263–286.
    [61] C. S. Perng, S. R. Zhang, and D. S. Parker, “The landmark model: an instance selection method for time series data,” Instance Selection and Construction for Data Mining, 608, 2001, pp. 113–130.
    [62] E. Keogh and S. Kasetty, “On the need for time series data mining benchmarks: a survey and empirical demonstration,” in Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 2002, pp. 102-111.
    [63] E. Keogh, “Efficiently finding arbitrarily scaled patterns in massive time series databases,” Knowledge Discovery in Database, 2823, 2003, pp 253–265.
    [64] M. Vlachos, M. Hadjieleftheriou, D. Gunopulos, and E. Keogh, “Indexing multi-dimensional time-series with support for multiple distance measures,” in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2003, pp. 216-225.
    [65] T. Argyros and C. Ermopoulos, “Efficient subsequence matching in time series databases under time and amplitude transformations,” in Proceedings of the Third IEEE International Conference on Data Mining, 22 November 2003, pp. 481-484.
    [66] M. L. Hetland, “A survey of recent methods for efficient retrieval of similar time sequences.,” Series in Machine Perception and Artificial Intelligence / Data Mining in Time Series Databases, 2004, pp. 23-42.
    [67] E. Keogh and C. A. Ratanamahatana, “Exact indexing of dynamic time warping,” Knowledge and Information Systems, 7, 2005, pp. 358–386.
    [68] T. W. Liao, “Clustering of time series data—a survey,” Pattern Recognition, 38, 2005, pp. 1857-1874.
    [69] P. Protopapas, J. M. Giammarco, L. Faccioli, M. F. Struble, R. Dave, and C. Alcock, “Finding outlier light curves in catalogues of periodic variable stars,” Monthly Notices of the Royal Astronomical Society, 369(2), June 2006, pp.677–696.
    [70] G. Castellano, S. D. Villalba, and A. Camurri, “Recognising human emotions from body movement and gesture dynamics,” in Proceeding of the International Conference on Affective Computing and Intelligent Interaction, 2007, pp. 71-82.
    [71] D. Yankov, E. Keogh, and U. Rebbapragada, “Disk aware discord discovery: Finding unusual time series in terabyte sized datasets,” Knowledge and Information Systems, 17, 2008, pp.241–262.
    [72] I. Aydin, M. Karakose, and E. Akin, “The prediction algorithm based on fuzzy logic using time series data mining method,” World Academy of Science, Engineering and Technology, 51(27), 2009, pp. 91-98.
    [73] V. Chandola, D. Cheboli, and V. Kumar, Detecting Anomalies in a Time Series Database, Technical Report of Department of Computer Science and Engineering University of Minnesota, 2009.
    [74] Z. Zhang, J. Jiang, X. Liu, R. Lau, H. Wang, and R. Zhang, “A real time hybrid pattern matching scheme for stock time series,” in Proceedings of the 21st Australasian Conference on Database Technologies, 2010, pp.161–170.
    [75] Y. S. Jeong, M. K. Jeong, and O. A. Omitaomu, “Weighted dynamic time warping for time series classification,” Pattern Recognition, 14(9), 2011, pp. 2231-2240.
    [76] M. Raptis, D. Kirovski, and H. Hoppe, “Real-time classification of dance gestures from skeleton animation,” in Proceeding of the 2011 ACM SIGGRAPH/Euro Graphics Symposium on Computer Animation, 2011, pp.147-156.
    [77] S. Sridevi, S. Abirami, and S. Rajaram, “Detecting and revamping of X-outliers in time series database,” International Journal of Computer Applications, 60(19), 2012, pp. 28-33.
    [78] Z. Banko and J. Abonyi, “Correlation-based dynamic time warping of multivariate time series,” Expert Systems with Applications, 40, 2013, pp. 6055-6063.
    [79] S. Rani and G. Sikka, “Recent techniques of clustering of time series data: a survey,” International Journal of Computer Applications, 52(15), 2012, pp. 1-9.
    [80] A. V. Barbosa, R.-M. De´chaine, and E. Vatikiotis-Bateson, “Quantifying time-varying coordination of multimodal speech signals using correlation map analysis,” The Journal of the Acoustical Society of America, 131(3), March 2012. pp. 2162-2172.
    [81] J. Lin, S. Williamson, K. Borne, and D. DeBarr, “Pattern recognition in time series,” Advances in Machine Learning and Data Mining for Astronomy, 2012, pp. 617-645.
    [82] X. Wang, A. Mueen, H. Ding, G. Trajcevski, P. Scheuermann, and E. Keogh, “Experimental comparison of representation methods and distance measures for time series data.,” Data Mining and Knowledge Discovery, 26, 2013, pp. 275–309.
    [83] Y. Yu, Y. Zhu, S. Li, and D. Wan, “Time series outlier detection based on sliding window prediction,” Corporation Mathematical Problems in Engineering, 2014, Article ID 879736, 2014, pp. 1-14.
    [84] Z. Banko and J. Abonyi, “Mixed dissimilarity measure for piecewise linear approximation based,” Expert Systems with Applications 42(2015), 2015, pp. 7664–7675.
    [85] T. Gorecki and M. Łuczak, “Multivariate time series classification with parametric derivative dynamic time warping,” Expert Systems with Applications, 42(5), 2015, pp. 2305-2312.
    [86] H. Izakian, W. Pedrycz, and Q. Jamal, “Fuzzy clustering of time series data using dynamic time warping distance,” Engineering Applications of Artificial Intelligence, 39, March 2015, pp. 235-244.
    [87] J. Paparrizos and L. Gravano, “K-shape: efficient and accurate clustering of time series,” in Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, May 2015, pp. 1855-1870.
    [88] S. Aghabozorgi, A. Shirkhorshidi, and T. Wah, “Time-series clustering: a decade review,” Information Systems, 53, October–November 2015, pp. 16-38.
    [89] S.-H. Cheng, S.-M. Chen, and W.-S. Jian, “Fuzzy time series forecasting based on fuzzy logical relationships and similarity measures,” Information Sciences, 327(2016), 2016, pp.272-287.
    [90] M. Podsiadlo and H. Rybinsk, “Financial time series forecasting using rough sets with time-weighted rule voting,” Expert Systems with Applications, 66, December 2016, pp. 219-233.
    [91] T. Santos and R. Kern. “A literature survey of early time series classification and deep learning,” in Proceeding of SamI40 Workshop at i-KNOW ’16, Graz, Austria, 2016, pp. 1-7.
    [92] X. Gong, Y.-W. Si, S. Fong, P. Robert, and Biuk-Aghai, “Financial time series pattern matching with extended UCR Suite and support vector machine,” Expert Systems with Applications, 55, August 2016, pp. 284-296.
    [93] I. Maric, “Retrieving sinusoids from nonuniformly sampled data using recursive formulations,” Expert Systems with Applications, 72, 2017, pp.245-257.
    [94] I. Oregi, J. D. Ser, A. P´erez, and J. A. Lozano, “Nature-inspired approaches for distance metric learning in multivariate time series classification,” in Proceeding of the IEEE Congress on Evolutionary Computation, 2017, pp. 1992-1998.
    [95] S. Sridevi, S. Parthasarathy, and S. Rajaram, “An effective prediction system for time series data using pattern matching algorithms,” International Journal of Industrial Engineering, 25(2), 2018, pp. 123-136.
    [96] P. E. Tsinaslanidis, “Subsequence dynamic time warping for charting: Bullish and bearish class predictions for NYSE stocks,” Expert Systems with Applications, 94, 2018, pp.193–204.
    [97] S. H. Kim, H. S. Lee, H. J. Ko, S. H. Jeong, H. W. Byun, and K. J. Oh, “Pattern matching trading system based on the dynamic time warping algorithm,” Sustainability, 10(12), 4641, 2018, pp. 1-18.
    [98] N. T. Son. “Pattern matching under dynamic time warping for time series prediction,” Natural Sciences and Technology, 15(3), 2018, pp. 148-160.
    [99] S. K. Behera, D. P. Dogra, and P. P. Roy, “Fast recognition and verification of 3D air signatures using convex hulls,” Expert Systems with Applications, 100, 2018, pp.106–119.
    [100] X. Gong, S. Fong, and A.-W. Si, “Fast fuzzy subsequence matching algorithms on time-series,” Expert Systems with Applications, 116, 2019, pp. 275-284.
    [101] H. Chen and X. Gao, “A new time series similarity measurement method based on fluctuation features,” Technical Gazette, 27(4), 2020, pp.1134-1141.
    [102] J. Wang and C. Zhang, “A similarity measurement for multivariate time series based on variable clustering,” in Proceeding of the 2021 IEEE Seventh International Conference on Big Data Computing Service and Applications, 2021, pp. 190-195.
    [103] A. Lahreche and B. Boucheham, “A fast and accurate similarity measure for long time series classification based on local extrema and dynamic time warping,” Expert Systems with Applications, 168, 114374, 2021, pp. 1-12.
    [104] S. Du, M. Wu, L. Chen, W. Cao, and W. Pedrycz, “Information granulation with rectangular information granules and its application in time-series similarity measurement,” IEEE Transactions on Fuzzy Systems, 30(10), 2022, pp. 4069-4081.
    [105] Q. Zhang, C. Zhang, L. Cui, X. Han, Y. Jin, G. Xiang, and Y. Shi, “A method for measuring similarity of time series based on series decomposition and dynamic time warping,” Applied Intelligence, 53, 2023, pp. 6448–6463.
    [106] J. Zhou and M. Li, “Research on improving time series similarity based on segmented local representation,” Academic Journal of Computing & Information Science, 7(4), 2024, pp.45-55.
    [107] B. M. Bolstad, R. A. Irizarry, M. Åstrand, and T. P. Speed, “A comparison of normalization methods for high density oligonucleotide array data based on variance and bias,” Bioinformatics, 19(2), 2003, pp. 185-193.
    [108] V. J. Hodge and J. Austin, “A survey of outlier detection methodologies,” Artificial Intelligence Review, 22, 2004, pp. 85-126.
    [109] L. Xiong, G. Piatetsky-Shapiro, and W. Chen, “Discovering coherent outliers in multi-attribute data sets,” Data Mining and Knowledge Discovery, 5, 2011, pp. 1-26.
    [110] E. J. Keogh and M. J. Pazzani, “Derivative dynamic time warping,” in Proceedings of the 1st SIAM International Conference on Data Mining, Chicago, Apr 5-7, 2001. Philadelphia: SIAM, 2001, pp. 1-11.
    [111] P. Maragos, A. Dimakis, and I. Kokkinos, “Some advances in nonlinear speech modeling using modulations, fractals, and chaos,” in Proceeding of the IEEE International Conference on Digital Signal Processing, 2002, pp. 325-332.
    [112] I. Sadek and J. Biswas, “Nonintrusive heart rate measurement using ballistocardiogram signals: a comparative study,” Signal, Image and Video Processing, 13(3), 2018, pp. 475–482.
    [113] M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander, “LOF: identifying density-based local outliers,” in Proceedings of the 2000 ACM SIGMOD International Conference on Management of data, 2000, pp. 93–104.
    [114] H.-P. Kriegel, P. Kröger, E. Schubert, and A. Zimek, “LoOP: local outlier probabilities,” in Proceedings of the 18th ACM Conference on Information and Knowledge Management,2009, pp. 1649–1652.
    [115] I. H. Witten, E. Frank, M. A. Hall, and C. J. Pal, “Data mining: practical machine learning tools and techniques with Java implementations,” ACM SIGMOD Record, 31(1), 2002, pp. 76-77.
    [116] G. E. P. Box and D. R. Cox, “An analysis of transformations,” Journal of the Royal Statistical Society. Series B (Methodological), 26(2), 1964, pp. 211-243.
    [117] R. H. Shumway, D. S. Stoffer, and D. S. Stoffer, Time Series Analysis and Its Applications, vol. 3, New York: Springer, 2000.
    [118] W. S. Cleveland, “Robust locally weighted regression and smoothing scatterplots,” Journal of the American Statistical Association, 74(368), 1979, pp. 829-836.
    [119] L. A. Zadeh, “Fuzzy sets,” Information and Control, 8(3), 1965, pp. 338-353.
    [120] B. Iglewicz and D. C. Hoaglin, Volume 16: How to Detect and Handle Outliers, American Society for Quality Control Press, 1993.
    [121] Z. Wang, Y. Wang, C. Gao, F. Wang, T. Lin, and Y. Chen, “An adaptive sliding window for anomaly detection of time series in wireless sensor networks,” Wireless Networks, 28, 2022, pp. 393–411.
    [122] C. Chatfield and H. Xing, The Analysis of Time Series: An Introduction, Chapman and Hal /CRC (7th Edition), 2019.
    [123] J. Brownlee, Deep Learning for Time Series Forecasting: Predict the Future with MLPs, CNNs, and LSTMs in Python, Machine Learning Mastery, 2018.
    [124] R. J. Hyndman and G. Athanasopoulos, Forecasting: Principles and Practice, OTexts, 2018.
    [125] G. E. P. Box, G. M. Jenkins, G. C. Reinsel, and G. M. Ljung, Time Series Analysis: Forecasting and Control, 3rd Edition, Prentice-Hall International, Inc., 2015.
    [126] S. Golestan, M. Ramezani, J. M. Guerrero, F. D. Freijedo, and M. Monfared, “Moving average filter based phase locked: performance analysis and design guidelines,” IEEE Transaction on Power Electronics, 29(6). 2014, pp. 2750–2763.
    [127] P. K. Vemulapalli, V. Monga, and S. N. Brennan, “Robust extrema features for time-series data analysis,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(6), 2012, pp. 1464-1479.
    [128] E. J. Keogh and M. J. Pazzani, “Scaling up dynamic time warping to massive datasets,” in Proceeding. of the 6th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, 2000, pp. 285–289.
    [129] R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision, Cambridge University Press, 2003.
    [130] Jui-Hua Huang, Yong-Han Chen and Yen-Lung Tsai, Utilizing Cross-Ratios for the Detection and Correction of Missing Digits in Instrument Digit Recognition, Mathematics, 2024, 12, 1669.
    [131] E. Keogh and C. A. Ratanamahatana, “Exact indexing of dynamic time warping,” Knowledge and Information Systems, 7(3), 2005, pp. 358–386.
    [132] T. Rakthanmanon, B. Campana, A. Mueen, G. Batista, B. Westover, Q. Zhu, J. Zakaria, and E. Keogh, “Searching and mining trillions of time series subsequences under dynamic time warping,” in Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'12), 2012, pp. 262-270.
    [133] F. Zhou and F. De la Torre, “Generalized time warping for multi-modal alignment of human motion,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 38(2), 2016, pp. 201-213.
    [134] H. T. Nguyen and B. Wu, Fuzzy Mathematics and Statistical Applications, Taipei City: Junjie Book Store Co., Ltd., 2000.
    [135] B. Wu, Introduction to Fuzzy Statistics- Methods and Applications, Wunan Book Publishing Co., Ltd., Taipei, 2005.
    [136] Andrew W. Lo, Harry Mamaysky, and Jiang Wang, “Foundations of Technical Analysis: Computational Algorithms, Statistical Inference, and Empirical Implementation,” The Journal of Finance, vol. 55, Issue 4, August 2000, pp. 1705-1765.
    [137] F. Keller, E. l. Muller, and K. Bohm, “HICS: High contrast subspaces for density-based outlier ranking,” in Proceeding of IEEE 28th International Conference on Data Engineering, 2012, pp.1037–1048.
    [138] C. C. Aggarwal, An Introduction to Outlier Analysis, Springer, 2017.
    Description: 博士
    國立政治大學
    應用數學系
    105751503
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0105751503
    Data Type: thesis
    Appears in Collections:[應用數學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    150301.pdf21544KbAdobe PDF0View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback