English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52052/87180 (60%)
Visitors : 8894074      Online Users : 88
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/101112

    Title: Pincer-Style Maximal Sequential Pattern Mining
    Authors: Jou, Chichang;Wu, Chen-Cheng
    Contributors: 淡江大學資訊管理學系
    Keywords: Sequential Pattern Mining
    Date: 2013-07-23
    Issue Date: 2015-04-13 16:07:43 (UTC+8)
    Publisher: IADIS
    Abstract: Apriori-based sequential pattern mining algorithms use bottom-up method. They join frequent patterns with shorter length into candidate patterns with longer length, and then repeat the process until no more candidate patterns could be generated. In many applications, only frequent maximal sequential patterns (MSP), which are not a sub-sequence of any other frequent sequential pattern, are requested. In these cases, the Apriori-based algorithms will generate all sequential patterns first, and then eliminate non-maximal ones. That would perform lots of computations not directly related to the final results. For this reason, we propose the Pincer-Style Maximal Sequential Pattern Mining algorithm, PMSPM, to obtain all frequent MSPs by eliminating most of the intermediate steps in the Apriori-based algorithms. Like a pincer’s movement, PMSPM alternates bottom-up and top-down directions to find many MSPs in the early top-down stages. Thus, minings in the bottom-up direction could safely skip many repetitive procedures. PMSPM could save lots of support counting efforts to reduce computing time. We implement PMSPM and compare its performance with that of an Apriori-like algorithm. We also test effects of database parameters on its performance.
    Relation: pp.79-83
    Appears in Collections:[資訊管理學系暨研究所] 會議論文

    Files in This Item:

    There are no files associated with this item.

    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