Discovering Time-Interval Sequential Patterns by a Pattern Growth Approach with Confidence Constraints

Q3 Engineering
Huan-Jyh Shyur, Chichang Jou, Chi-Bin Cheng, Chih-Yu Yen
{"title":"Discovering Time-Interval Sequential Patterns by a Pattern Growth Approach with Confidence Constraints","authors":"Huan-Jyh Shyur, Chichang Jou, Chi-Bin Cheng, Chih-Yu Yen","doi":"10.6186/IJIMS.2016.27.2.4","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":39953,"journal":{"name":"International Journal of Information and Management Sciences","volume":"5 1","pages":"129-145"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Information and Management Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6186/IJIMS.2016.27.2.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

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.
带置信约束的模式增长方法发现时间间隔序列模式
序列模式挖掘是在序列数据库中发现频繁的序列模式。该技术被应用于网络点击流挖掘、故障预测和流量分析等领域。传统的顺序模式挖掘方法通常只关注项目的顺序;但是,当关注事件发生的时间时,两个连续事件之间的时间间隔可能是有价值的信息。本研究扩展了众所周知的模式增长方法PrefixSpan算法的概念,提出了一种新的具有时间间隔的序列模式挖掘方法。与其他时间间隔顺序模式挖掘算法不同,该方法更多地关注下一个事件发生的时间,而不是其先前事件的时间信息。为了获得更可靠的序列模式,定义了一种新的序列模式置信度度量。通过实验来评估该方法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Information and Management Sciences
International Journal of Information and Management Sciences Engineering-Industrial and Manufacturing Engineering
CiteScore
0.90
自引率
0.00%
发文量
0
期刊介绍: - Information Management - Management Sciences - Operation Research - Decision Theory - System Theory - Statistics - Business Administration - Finance - Numerical computations - Statistical simulations - Decision support system - Expert system - Knowledge-based systems - Artificial intelligence
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信