A GA-based approach for finding appropriate granularity levels of patterns from time series. (2016)

• Record Type: Journal Article
• Authors: Chen, Chun-Hao; Tseng, Vincent S.; Yu, Hsieh-Hui; Hong, Tzung-Pei; Yen, Neil Y.
• Is Part Of: International journal of web and grid services. Volume 12:Number 3(2016)
• Page Start: 217
• Page End: 239
• Publication Date: 2016
• Subjects: genetic algorithms -- time series segmentation -- clustering -- PIPs -- perceptually important points -- granularity levels -- patterns -- cut points -- cluster affinity search -- affinity threshold; Web services -- Periodicals; Computational grids (Computer systems) -- Periodicals; 006.78
• Languages: English
• ISSNs: 1741-1106

Abstract

In our previous approach, we proposed an algorithm for finding segments and patterns simultaneously from a given time series. In that approach, because patterns were derived through clustering techniques, the number of clusters was hard to be setting. In other words, the granularity of derived patterns was not taken into consideration. Hence, an approach for deriving appropriate granularity levels of patterns is proposed in this paper. The cut points of a time series are first encoded into a chromosome. Each two adjacent cut points represents a segment. The segments in a chromosome are then divided into groups using the cluster affinity search technique with a similarity matrix and an affinity threshold. With the affinity threshold, patterns with the desired granularity level can be derived. Experiments on a real dataset are also conducted to demonstrate the effectiveness of the proposed approach.