首页> 外文会议>International Conference on Signal-Image Technology and Internet-Based Systems >An Approach to Mine Time Interval Based Weighted Sequential Patterns in Sequence Databases
【24h】

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

机译:序列数据库中基于矿山时间间隔的加权序列模式的一种方法

获取原文

摘要

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)的新方法。在提出的方法中,从序列中连续元素的时间间隔中获取序列数据库中每个序列的权重,然后通过考虑时间间隔权重来挖掘序列模式。实验结果表明,TIWSP挖掘在生成更多有趣的模式方面比PrefixSpan有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号