English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62379/95055 (66%)
造訪人次 : 2294701      線上人數 : 159
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/78594

    題名: Incremental Mining of Across-streams Sequential Patterns in Multiple Data Streams
    作者: Yang, Shih-yang;Chao, Ching-ming;Chen, Po-zung;Sun, Chu-hao
    貢獻者: 淡江大學資訊工程學系
    關鍵詞: Multiple data streams;Data stream mining;Sequential pattern mining;Incremental mining
    日期: 2011-03
    上傳時間: 2012-10-17 10:49:21 (UTC+8)
    出版者: Oulu: Academy Publisher
    摘要: Sequential pattern mining is the mining of data sequences for frequent sequential patterns with time sequence, which has a wide application. Data streams are streams of data that arrive at high speed. Due to the limitation of memory capacity and the need of real-time mining, the results of mining need to be updated in real time. Multiple data streams are the simultaneous arrival of a plurality of data streams, for which a much larger amount of data needs to be processed. Due to the inapplicability of traditional sequential pattern mining techniques, sequential pattern mining in multiple data streams has become an important research issue. Previous research can only handle a single item at a time and hence is incapable of coping with the changing environment of multiple data streams. In this paper, therefore, we propose the IAspam algorithm that not only can handle a set of items at a time but also can incrementally mine across-streams sequential patterns. In the process, stream data are converted into bitmap representation for mining. Experimental results show that the IAspam algorithm is effective in execution time when processing large amounts of stream data.
    關聯: Journal of Computers 6(3), pp.449-457
    DOI: 10.4304/jcp.6.3.449-457
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



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