English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49287/83828 (59%)
Visitors : 7150953      Online Users : 67
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/17390


    Title: Fast Mining of Closed Sequential Patterns
    Authors: Lin, Nancy P.;Hao, Wei-hua;Chen, Hung-jen;Chueh, Hao-en;Chang, Chung-i
    Contributors: 淡江大學軍訓室
    Keywords: data mining;sequential patterns mining;closed sequential patterns
    Date: 2008-04
    Issue Date: 2013-06-07 10:46:07 (UTC+8)
    Publisher: Athens: World Scientific and Engineering Academy and Society
    Abstract: This paper propose a novel algorithm for mining closed frequent sequences, a scalable, condensed and lossless structure of complete frequent sequences that can be mined from a sequence database. This algorithm, FMCSP, has applied several optimization methods, such as equivalence class, to alleviate the needs of searching space and run time. In particular, since one of the main issues in this type of algorithms is the redundant generation of the closed sequences, hence, we propose an effective and memory saving methods, different from previous works, does not require the complete set of closed sequences to be residing in the memory.
    Relation: WSEAS Transactions on Computers 7(4), pp.133-139
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

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