An Approach to Mine Time Interval Based Weighted Sequential Patterns in Sequence Databases

Sirisha Alamanda, S. Pabboju, G. Narsimha
{"title":"An Approach to Mine Time Interval Based Weighted Sequential Patterns in Sequence Databases","authors":"Sirisha Alamanda, S. Pabboju, G. Narsimha","doi":"10.1109/SITIS.2017.16","DOIUrl":null,"url":null,"abstract":"Sequence pattern mining is an important data mining task with broad applications. Many sequence mining algorithms have been developed to discover frequent sub-sequences as sequential patterns in a sequence database given the minimum support threshold. One of the drawbacks with the conventional sequential pattern mining is, it considered only the generation order of elements in the sequences in finding sequential patterns.However, in real world application domain sequences, the generation times and time-intervals between the elements are also very important. Another drawback is, all the sequence patterns are treated uniformly while in reality different sequential patterns have different importance. To address the second drawback, weighted sequential pattern mining was proposed, which aims to find more interesting sequential patterns, by considering different significance for data elements in a sequence database. However, weighted sequential pattern mining did not consider time-interval information of the sequences. This paper presents a new approach for mining time-interval based weighted sequential patterns (TIWSP) in a sequence database. In the proposed approach, the weight of each sequence in a sequence database is obtained from the time-intervals of successive elements in the sequence, and then sequential pattern are mined by considering the time interval weight. Experimental results show that TIWSP mining is efficient than PrefixSpan in generating more interesting patterns.","PeriodicalId":153165,"journal":{"name":"2017 13th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SITIS.2017.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Sequence pattern mining is an important data mining task with broad applications. Many sequence mining algorithms have been developed to discover frequent sub-sequences as sequential patterns in a sequence database given the minimum support threshold. One of the drawbacks with the conventional sequential pattern mining is, it considered only the generation order of elements in the sequences in finding sequential patterns.However, in real world application domain sequences, the generation times and time-intervals between the elements are also very important. Another drawback is, all the sequence patterns are treated uniformly while in reality different sequential patterns have different importance. To address the second drawback, weighted sequential pattern mining was proposed, which aims to find more interesting sequential patterns, by considering different significance for data elements in a sequence database. However, weighted sequential pattern mining did not consider time-interval information of the sequences. This paper presents a new approach for mining time-interval based weighted sequential patterns (TIWSP) in a sequence database. In the proposed approach, the weight of each sequence in a sequence database is obtained from the time-intervals of successive elements in the sequence, and then sequential pattern are mined by considering the time interval weight. Experimental results show that TIWSP mining is efficient than PrefixSpan in generating more interesting patterns.
序列数据库中基于时间间隔的加权序列模式挖掘方法
序列模式挖掘是一项重要的数据挖掘任务,有着广泛的应用。为了在给定最小支持阈值的序列数据库中发现作为序列模式的频繁子序列,已经开发了许多序列挖掘算法。传统的序列模式挖掘方法的缺点之一是在寻找序列模式时只考虑序列中元素的生成顺序。然而,在现实世界的应用领域序列中,元素之间的生成次数和时间间隔也非常重要。另一个缺点是,所有的序列模式都是统一处理的,而实际上不同的序列模式具有不同的重要性。为了解决第二个缺点,提出了加权顺序模式挖掘,该方法通过考虑序列数据库中数据元素的不同意义来发现更多有趣的顺序模式。然而,加权序列模式挖掘没有考虑序列的时间间隔信息。提出了一种挖掘序列数据库中基于时间间隔的加权序列模式的新方法。该方法根据序列中连续元素的时间间隔获得序列数据库中每个序列的权重,然后根据时间间隔权重挖掘序列模式。实验结果表明,TIWSP挖掘在生成更有趣的模式方面比PrefixSpan更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信