English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51896/87052 (60%)
Visitors : 8463409      Online Users : 120
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/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:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML108View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback