Offline –suffix Tree Based Combination Formation in Periodicity Mining[

Full Text(PDF, ) PP.I062I068


Author(s) 
V. Prema, Mr. S. Shahul Hameed 

KEYWORDS 


ABSTRACT 
Periodic pattern mining or periodicity detection has a number of applications, such as prediction, forecasting, detection of unusual activities, etc. The problem is not trivial because the data to be analyzed are mostly noisy and different periodicity types (namely symbol, sequence, and segment) are to be investigated. Accordingly, we argue that there is a need for a comprehensive approach capable of analyzing the whole time series or in a subsection of it to effectively handle different types of noise (to a certain degree) and at the same time is able to detect different types of periodic patterns; combining these under one umbrella is by itself a challenge. In this paper, we present an algorithm which can detect symbol, sequence (partial), and segment (full cycle) periodicity in time series. The algorithm uses suffix tree as the underlying data structure; this allows us to design the algorithm such that its worstcase complexity is O(k:n2), where k is the maximum length of periodic pattern and n is the length of the analyzed portion (whole or subsection) of the time series. The algorithm is noise resilient; it has been successfully demonstrated to work with replacement, insertion, deletion, or a mixture of these types of noise. We have tested the proposed algorithm on both synthetic and real data from different domains, including protein sequences. The conducted comparative study demonstrate the applicability and effectiveness of the proposed algorithm; it is generally more timeefficient and noiseresilient than existing algorithms. 

References 

1. M.G. Elfeky, W.G. Aref, and A.K.
Elmagarmid, “Periodicity Detection in Time
Series Databases”, IEEE Trans. Knowledge and
Data Eng., vol. 17, pp. 875887, July 2005.
2. K. Y. Huang and C.H. Chang, “SMCA: A
General Model for Mining Asynchronous
Periodic Patterns in Temporal Databases,” IEEE
Trans. Knowledge and Data Eng., vol. 17, no.6, pp.
774785, June 2005.
3. F. Rasheed and R. Alhajj, “Using Suffix
Trees for Periodicity Detection in Time Series
Databases,” Proc. IEEE Int’l Conf. Intelligent
System, Sept. 2008.
4. A. Al Rawi, A. Lansari, and F. Bouslama, “
A New NonRecursive Algorithm for Binary
Search Tree Traversal,” Proc. IEEE Int’l Conf.
Electronics, Circuits and systems(ICECS), vol.
2,pp.770773, Dec. 2003


