Clustering Time Series Data Mining dengan Jarak Kedekatan Manhattan City
Abstract
Full Text:
PDFReferences
U. Fayyad, G. Piatetsky-Shapiro, and P. Smyth, “From Data Mining to Knowledge Discovery in Databases,” AI Mag., vol. 17, no. 3, p. 37, 1996.
R. Agrawal, C. Faloutsos, and A. Swami, “Efficient Similarity Search In Sequence Databases,” Springer, 1993.
K. Luthfi emha taufiq, Algoritma Data Mining. Yogyakarta: ANDI, 2009.
R. Buaton, Y. Sundari, and Y. Maulita, “Clustering Tindak Kekerasan Keker Pada Anak Menggunakan Algoritm oritma K-Means Dengan Perbandingan ingan Jarak Kedekatan Manhattan City Dan an Eu Euclidean,” vol. 1, no. 2, 2016.
T. Fu, “Engineering Applications of Artificial Intelligence A review on time series data mining,” Eng. Appl. Artif. Intell., vol. 24, no. 1, pp. 164–181, 2011.
E. Keogh, “Clustering of Time Series Subsequences is Meaningless : Implications for Previous and Future Research,” 2005.
S. Park and wesley Chu, “Discovery and matching elastic rules from sequence database,” Fundam. Inform., 2001.
H. Wu, B. Salzberg, and D. Zhang, “Online Event-driven Subsequence Matching over Financial Data Streams,” Sigmod Conf., 2004.
G. Das, K. Lin, and H. Mannila, “Rule discovery from time series,” Am. Assoc. Artif. Intell., 1998.
J. Lin, S. Lonardi, J. Lin, and S. Lonardi, “Visualizing and Discovering Non-Trivial Patterns In Large Time Series Databases Short running title : Time Series Visualization Visualizing and Discovering Non-Trivial Patterns In Large Time Series Databases,” 2005.
E. Prasetyo, Data Mining : Konsep Dan Aplikasi Menggunakan Matlab. Yogyakarta: ANDI, 2012.
K. U. Yoshiki Tanaka, Kazuhisa Iwamoto, “Discovery of Time-Series Motif from Multi-Dimensional Data Based on MDL Principle,” Springer Sci. + Bus. Media, Inc. Manuf. Netherlands, no. 2000, pp. 269–300, 2005.
DOI: http://dx.doi.org/10.30645/senaris.v1i0.129
Refbacks
- There are currently no refbacks.