English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62372/95042 (66%)
造訪人次 : 2278890      線上人數 : 171
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 大小格式瀏覽次數



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