Identifikasi Motif Time Series Data Mining dengan Euclid

  • Relita Buaton Universitas Sumatera Utara
  • Muhammad Zarlis Universitas Sumatera Utara
  • Herman Mawengkang Universitas Sumatera Utara
  • Syahril Effendi Universitas Sumatera Utara
Keywords: motif time series data mining, distance euclid clustering


The development of information technology that is supported by storage media technology has brought about major changes to the availability of data warehouses. The availability of data warehouses is often overlooked because of the inability to process the data so that data stacks are often regarded as garbage, which should be used as decision support, one form of data warehouse that is often encountered today is time series. Therefore it is necessary to develop a method to improve the motive discovery of time series data mining. The method used is discretion so that it produces time series sub sequences, which are then clustered. The distance used is the euclid distance. The results obtained are the finding of motives in time series based on time that can be used as decision support and predictions in the future.


Akaike, Hirotugu. 1969. “Fitting Autoregressive Models For Prediction.” Annals of the Institute of Statistical Mathematics 21:243–247.

Castro, Nuno, and Paulo J Azevedo. 2008. “Time Series Motifs Statistical Significance.”

Ding, Hui, Goce Trajcevski, Peter Scheuermann, Xiaoyue Wang, and Eamonn Keogh. 2008. “Querying and Mining of Time Series Data : Experimental Comparison of Representations and Distance Measures.”

Fu, Tak-chung. 2011. “Engineering Applications of Artificial Intelligence A Review on Time Series Data Mining.” Engineering Applications of Artificial Intelligence 24 (1). Elsevier:164–81.

Keogh, Eamonn, and Shruti Kasetty. n.d. “On the Need for Time Series Data Mining Benchmarks : A Survey and Empirical Demonstration.”

Lauwers, Oliver, and Bart De Moor. 2017. “A Time Series Distance Measure for Efficient Clustering of Input / Output Signals by Their Underlying Dynamics” 1 (2):286–91.

Lin, Jessica, Eamonn Keogh, Stefano Lonardi, and Pranav Patel. 2002. “Finding Motifs in Time Series.” Proc. of the 2nd Workshop on Temporal Data Mining, 53–68.

Möller-levet, Carla Sofia, and Frank Klawonn. 2003. “Fuzzy Clustering of Short Time- Series and Unevenly Distributed Sampling Points” 2810 (June 2014).

Mueen, Abdullah, Sydney Cash, and Brandon Westover. 2002. “Exact Discovery of Time Series Motifs.”

Mueen, Abdullah, and Nikan Chavoshi. 2015. “Enumeration of Time Series Motifs of All Lengths.” Knowledge and Information Systems. Springer London, 105–32.

Oates, Tim. 1999. “Identifying Distinctive Subsequences in Multivariate Time Series by Clustering.” Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD ’99, 322–26.

Rakthanmanon, Thanawin, Bilson Campana, Abdullah Mueen, Gustavo Batista, Brandon Westover, Qiang Zhu, Jesin Zakaria, and Eamonn Keogh. 2013. “Addressing Big Data Time Series: Mining Trillions of Time Series Subsequences Under Dynamic Time Warping.” Transactions on Knowledge Discovery from Data (TKDD 7 (3):3047–51.

Rissanen, Jorma. 1989. “Stochastic Complexity in Statistical Inquiry.” World Scientific Series in Computer Science.

Serr, Joan. 2015. “Ranking and Significance of Variable-Length Similarity-Based Time Series Motifs ´.”

Serra, Joan, and Josep Ll Arcos. n.d. “An Empirical Evaluation of Similarity Measures for Time Series Classification.”

Warren Liao, T. 2005. “Clustering of Time Series Data - A Survey.” Pattern Recognition 38 (11):1857–74.

Yoshiki Tanaka, Kazuhisa Iwamoto, Kuniaki Uehera. 2005. “Discovery of Time-Series Motif from Multi-Dimensional Data Based on MDL Principle.” Springer Science + Business Media, Inc. Manufactured in The Netherlands, no. 2000:269–300.