English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49523/84769 (58%)
Visitors : 7606843      Online Users : 74
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/104281


    Title: Incremental mining of temporal patterns in interval-based database
    Authors: Hui, Lin;Chen, Yi-Cheng;Weng, Julia Tzu-Ya;Lee, Suh-Yin
    Keywords: Incremental mining;Dynamic representation;Sequential pattern;Temporal pattern
    Date: 2015-02-27
    Issue Date: 2016-01-06 10:54:03 (UTC+8)
    Publisher: Springer
    Abstract: In several real-life applications, sequence databases, in general, are updated incrementally with time. Some discovered sequential patterns may be invalidated and some new ones may be introduced by the evolution of the database. When a small set of sequences grow, or when some new sequences are added into the database, re-mining sequential patterns from scratch each time is usually inefficient and thus not feasible. Although there have been several recent studies on the maintenance of sequential patterns in an incremental manner, these works only consider the patterns extracted from time point-based data. Few research efforts have been elaborated on maintaining time interval-based sequential patterns, also called temporal patterns, where each datum persists for a period of time. In this paper, an efficient algorithm, Inc_TPMiner (Incremental Temporal Pattern Miner) is developed to incrementally discover temporal patterns from interval-based data. Moreover, the algorithm employs some optimization techniques to reduce the search space effectively. The experimental results on both synthetic and real datasets indicate that Inc_TPMiner significantly outperforms re-mining with static algorithms in execution time and possesses graceful scalability. Furthermore, we also apply Inc_TPMiner on a real dataset to show the practicability of incremental mining of temporal patterns.
    Relation: Knowledge and Information Systems 46(2), pp.423-448
    DOI: 10.1007/s10115-015-0828-5
    Appears in Collections:[資訊創新與科技學系] 期刊論文
    [資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML126View/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