English  |  正體中文  |  简体中文  |  Items with full text/Total items : 63187/95884 (66%)
Visitors : 4581146      Online Users : 312
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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/99535

    Title: Timed Sequential Pattern Mining Based on Confidence in Accumulated Intervals
    Authors: Jou, Chichang;Shyur, Huan-Jyh;Yen, Chih-Yu
    Contributors: 淡江大學資訊管理學系
    Keywords: timed sequential pattern mining;accumulated interval;PrefixSpan
    Date: 2014-08-15
    Issue Date: 2014-11-20 12:59:19 (UTC+8)
    Publisher: IEEE
    Abstract: Many applications of sequential patterns require a guarantee of a particular event happening within a period of time. We propose CAI-PrefixSpan, a new data mining algorithm to obtain confident timed sequential patterns from sequential databases. Based on PrefixSpan, it takes advantage of the pattern-growth approach. After a particular event sequence, it would first calculate the confidence level regarding the eventual occurrence of a particular event. For those pass the minimal confidence requirement, it then computes the minimal time interval that satisfies the support requirement. It then generates corresponding projected databases, and applies itself recursively on the projected databases. With the timing information, it obtains fewer but more confident sequential patterns. CAI-PrefixSpan is implemented along with PrefixSpan. They are compared in terms of numbers of patterns obtained and execution efficiency. Our effectiveness and performance study shows that CAI-PrefixSpan is a valuable and efficient approach in obtaining timed sequential patterns.
    Relation: Proceedings of the 15th International Conference on Information Reuse and Integration
    Appears in Collections:[Graduate Institute & Department of Information Management] Proceeding

    Files in This Item:

    File Description SizeFormat
    IRI-2014-submitted.pdf220KbAdobe PDF415View/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