By Topic

Periodicity data mining in time series using Suffix Arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xylogiannopoulos, K.F. ; Dept. of Inf. Technol., Hellenic American Univ., Manchester, NH, USA ; Karampelas, P. ; Alhajj, R.

This research paper focuses on data mining in time series and its applications on financial data. Data-mining attempts to analyze time series and extract valuable information about pattern periodicity, which might be concealed by substantial amounts of unformatted, random information. Such information, however, is of great importance as it can be used to forecast future behavior. In this paper, a new methodology is introduced aiming to utilize Suffix Arrays in data mining instead of the commonly used data structure Suffix Trees. Although Suffix Arrays, normally, require high storage capacity, the algorithm proposed allows them to be constructed in linear time. The methodology is also extended to detect repeated patterns in time series with time complexity of. This, combined with the capability of external storage, creates a critical advantage, for an overall efficient data mining and analysis regarding the construction of time series data structure and periodicity detection. The test results, presented below demonstrate the applicability and effectiveness of the proposed technique.

Published in:

Intelligent Systems (IS), 2012 6th IEEE International Conference

Date of Conference:

6-8 Sept. 2012