English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49064/83169 (59%)
造訪人次 : 6952052      線上人數 : 55
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    淡江大學機構典藏 > 行政單位 > 軍訓室 > 期刊論文 >  Item 987654321/17391
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/17391


    題名: Mining Strong Positive and Negative Sequential Patterns
    其他題名: 探勘強勢正向及負向序列型樣
    作者: Lin, Nancy P.;Chen, Hung-jen;Hao, Wei-hua;Chueh, Hao-en;Chang, Chung-i
    貢獻者: 淡江大學軍訓室;淡江大學資訊工程學系
    關鍵詞: Data mining,Itemset,Frequent sequence,Positive sequential pattern,Negative sequential pattern,Strong sequential pattern
    日期: 2008-03
    上傳時間: 2009-08-12 13:59:58 (UTC+8)
    出版者: Zographou: World Scientific and Engineering Academy and Society
    摘要: In data mining field, sequential pattern mining can be applied in divers applications such as basket analysis, web access patterns analysis, and quality control in manufactory engineering, etc. Many methods have been proposed for mining sequential patterns. However, conventional methods only consider the occurrences of itemsets in customer sequences. The sequential patterns discovered by these methods are called as positive sequential patterns, i.e., such sequential patterns only represent the occurrences of itemsets. In practice, the absence of a frequent itemset in a sequence may imply significant information. We call a sequential pattern as negative sequential pattern, which also represents the absence of itemsets in a sequence. The two major difficulties in mining sequential patterns, especially negative ones, are that there may be huge number of candidates generated, and most of them are meaningless. In this paper, we proposed a method for mining strong positive and negative sequential patterns, called PNSPM. In our method, the absences of itemsets are also considered. Besides, only sequences with high degree of interestingness will be selected as strong sequential patterns. An example was taken to illustrate the process of PNSPM. The result showed that PNSPM could prune a lot of redundant candidates, and could extract meaningful sequential patterns from a large number of frequent sequences.
    關聯: WSEAS Transations on Computers 7(3), pp.119-124
    顯示於類別:[軍訓室] 期刊論文
    [資訊工程學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    index.html0KbHTML238檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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