English  |  正體中文  |  简体中文  |  Items with full text/Total items : 50122/85141 (59%)
Visitors : 7890453      Online Users : 60
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/108207


    Title: Discovering Time-Interval Sequential Patterns by a Pattern Growth Approach with Confidence Constraints
    Authors: Shyur, Huan-Jyh;Jou, Chi-Chang;Cheng, Chi-Bin;Yen, Chih-Yu
    Keywords: Sequential pattern mining;time-interval sequential patterns;pattern growth;confidence
    Date: 2016/06/01
    Issue Date: 2016-11-08 02:11:02 (UTC+8)
    Publisher: 淡江大學管理科學學系
    Abstract: Sequential pattern mining is to discover frequent sequential patterns in a sequence database. The technique is applied to fields such as web click-stream mining, failure forecast, and traf- fic analysis. Conventional sequential pattern-mining approaches generally focus only the orders of items; however, the time interval between two consecutive events can be a valuable information when the time of the occurrence of an event is concerned. This study extends the concept of the well-known pattern growth approach, PrefixSpan algorithm, to propose a novel sequential pattern mining approach for sequential patterns with time intervals. Unlike the other time-interval sequential pattern-mining algorithms, the approach concerns the time for the next event to occur more than the timing information with its precedent events. To obtain a more reliable sequential pattern, a new measure of the confidence of a sequential pattern is defined. Experiments are conducted to evaluate the performance of the proposed approach.
    Relation: International Journal of Information and Management Sciences 27(2), pp.129-145
    DOI: 10.6186/IJIMS.2016.27.2.4
    Appears in Collections:[資訊管理學系暨研究所] 期刊論文

    Files in This Item:

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