English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62572/95237 (66%)
造访人次 : 2545369      在线人数 : 334
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/108703

    题名: Discovering Time-Interval Sequential Patterns by a Pattern Growth Approach with Confidence Constraints
    作者: Shyur, Huan-Jyh;Jou, Chi-Chang;Cheng, Chi-Bin;Yen, Chih-Yu
    关键词: Sequential pattern mining;Time-interval sequential patterns;Pattern growth;Confidence
    日期: 2016-05-14
    上传时间: 2016-12-03 02:11:28 (UTC+8)
    摘要: Sequential pattern mining is to discover frequent sequential patterns in a sequence database. The technique is applied to fields such as web click-stream mining, failure forecast, and traffic analysis. Conventional sequential pattern mining approaches generally focus only the orders of items; however, the time interval between two consecutive events can be a more valuable information when the time of the occurrence of an event is concerned. This study extends the concept of the well-known pattern growth approach, PrefixSpan algorithm, to propose a novel sequential pattern mining approach for sequential patterns with time intervals. The current study suggests that the confidence of the occurrence of a pattern is also important other than the frequency (i.e. support) of the pattern. Thus, the proposed approach extracts a pattern by first satisfying a minimum confidence constraint, and then finds out the least time interval that satisfies the minimum support constraint. Experiments are conducted to evaluate the performance of the proposed approach.
    關聯: 論文集
    显示于类别:[資訊管理學系暨研究所] 會議論文





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