淡江大學機構典藏:Item 987654321/17390
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 58649/92364 (63%)
造访人次 : 574197      在线人数 : 112
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/17390


    题名: Fast Mining of Closed Sequential Patterns
    作者: Lin, Nancy P.;Hao, Wei-hua;Chen, Hung-jen;Chueh, Hao-en;Chang, Chung-i
    贡献者: 淡江大學軍訓室
    关键词: data mining;sequential patterns mining;closed sequential patterns
    日期: 2008-04
    上传时间: 2013-06-07 10:46:07 (UTC+8)
    出版者: Athens: World Scientific and Engineering Academy and Society
    摘要: 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.
    關聯: WSEAS Transactions on Computers 7(4), pp.133-139
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML308检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈