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


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/109383


    题名: Discovering Time-Interval Sequential Patterns by a Pattern Growth Approach with Confidence Constraints
    作者: Shyur, Huan-Jyh;Jou, Chichang;Cheng, Chi-Bin;Yen, Chih-Yu
    关键词: Sequential pattern mining;time-interval sequential patterns;pattern growth;confidence
    日期: 2016
    上传时间: 2017-01-17 11:27:44 (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 traf- fic analysis. Conventional sequential pattern-mining approaches generally focus only the orders of items; however, the time interval between two consecutive events can be a 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. Unlike the other time-interval sequential pattern-mining algorithms, the approach concerns the time
    for the next event to occur more than the timing information with its precedent events. To obtain a more reliable sequential pattern, a new measure of the confidence of a sequential pattern is defined. Experiments are conducted to evaluate the performance of the proposed approach.
    關聯: nternational Journal of Information and Management Sciences 27 (2), pp.129-145
    DOI: 10.6186/IJIMS.2016.27.2.4
    显示于类别:[資訊與管理科學期刊] 第27卷第2期

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html全文連結0KbHTML38检视/开启

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

    TAIR相关文章

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