Noise Resilient Periodicity Mining In Time Series Data bases
| ||International Journal of Computer Trends and Technology (IJCTT)|| |
|© - July Issue 2013 by IJCTT Journal|
|Volume-4 Issue-7 |
|Year of Publication : 2013|
|Authors :M.Gayathri, K.Prasad Rao|
M.Gayathri, K.Prasad Rao"Noise Resilient Periodicity Mining In Time Series Data bases"International Journal of Computer Trends and Technology (IJCTT),V4(7):2022-2025 July Issue 2013 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract: - One important aspect of the data mining is found out the interesting periodic patterns from time series databases. One area of research in time series databases is periodicity detection. Time series prognosticating is the use of a model to presage future values based on previously observed values. Discovering periodic patterns from an entire time series has proven to be inadequate in applications where the periodic patterns occur only with in small segments of the time series. In this paper we proposed a couple of algorithms to extract interesting periodicities (Symbol, Sequence, and Segment) of whole time series or part of the time series. One algorithm utilizes Dynamic warping Technique and other one is suffix tree as a data structure. Couple of these algorithms has been successfully incontestable to work with replacement, Insertion, deletion, or a mixture of these types of noise. The algorithm is compared with DTW (Dynamic Time Warping) algorithm on different types of data size and periodicity on both real and synthetic data. The worst case complexity of the suffix tree noise resilient algorithm is O (n.k 2 ) where n is the maximum length of the periodic pattern. K is size of the portion (whole or subsection) of the time series.
. M. Ahdesma¨ki, H. La¨hdesma¨ki, R. Pearson, H. Huttunen, and O. Yli-Harja, “Robust Detection of Periodic Time Series Measured from Biological Systems,” BMC Bioinformatics, vol. 6, no. 117, 2005
. C. Berberidis, W. Aref, M. Atallah, I. Vlahavas, and A. Elmagarmid, “Multiple and Partial Periodicity Mining in Time Series Databases,” Proc. European Conf. Artificial Intelligence, July 2002.
. C.-F. Cheung, J.X. Yu, and H. Lu, “Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory,” IEEE
. Trans. Knowledge and Data Eng., vol. 17, no. 1, pp. 90-105, Jan. 2005.
. M. Dubliner “Faster Tree Pattern Matching,” J. ACM, vol. 14, pp. 205-213, 1994.
. M.G. Elfeky, W.G. Aref, and A.K. Elmagarmid, “Periodicity Detection in Time Series Databases,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 7, pp. 875-887, July 2005.
. M.G. Elfeky, W.G. Aref, and A.K. Elmagarmid, “WARP: Time Warping for Periodicity Detection,” Proc. Fifth IEEE Int’l Conf. Data Mining, Nov. 2005.
. D. Gusfield, Algorithms on Strings, Trees, and Sequences. Cambridge Univ. Press, 1997.
Keywords : — Time Series, suffix tree, periodicity detection, noise resilient, DTW .