English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51772/86996 (60%)
造訪人次 : 8371099      線上人數 : 54
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/92477

    題名: A data mining approach to discovering reliable sequential patterns
    作者: Shyur, Huan-Jyh;Jou, Chichang;Chang, Keng
    貢獻者: 淡江大學資訊管理學系
    關鍵詞: Data mining;Sequential patterns;Inter-arrival time probability
    日期: 2013-08
    上傳時間: 2013-10-15 23:22:22 (UTC+8)
    出版者: New York: Elsevier Inc.
    摘要: Sequential pattern mining is a data mining method for obtaining frequent sequential patterns in a sequential database. Conventional sequence data mining methods could be divided into two categories: Apriori-like methods and pattern growth methods. In a sequential pattern, probability of time between two adjacent events could provide valuable information for decision-makers. As far as we know, there has been no methodology developed to extract this probability in the sequential pattern mining process. We extend the PrefixSpan algorithm and propose a new sequential pattern mining approach: P-PrefixSpan. Besides minimum support-count constraint, this approach imposes minimum time-probability constraint, so that fewer but more reliable patterns will be obtained. P-PrefixSpan is compared with PrefixSpan in terms of number of patterns obtained and execution efficiency. Our experimental results show that P-PrefixSpan is an efficient and scalable method for sequential pattern mining.
    關聯: Journal of Systems and Software 86(8), p.2196–2203
    DOI: 10.1016/j.jss.2013.03.105
    顯示於類別:[資訊管理學系暨研究所] 期刊論文


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



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