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


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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
    显示于类别:[資訊管理學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    A data mining approach to discovering reliable sequential patterns.pdf1152KbAdobe PDF1检视/开启
    index.html0KbHTML322检视/开启
    index.html0KbHTML398检视/开启

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

    TAIR相关文章

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