A GA-based approach for finding appropriate granularity levels of patterns from time series

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/107914

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/107914

Title:	A GA-based approach for finding appropriate granularity levels of patterns from time series
Authors:	Chen, Chun-Hao;Tseng, Vincent S.;Yu, Hsieh-Hui;Hong, Tzung-Pei;Yen, Neil Y.
Date:	2016-01
Issue Date:	2016-10-18 02:10:22 (UTC+8)
Publisher:	Inderscience Publishers
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.
Relation:	International Journal of Web and Grid Services 12(3), pp.217 - 239
DOI:	10.1504/IJWGS.2016.079159
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	224	View/Open