期刊文献+

一种改进的时间序列模式发现算法 被引量:2

An Improved Algorithm for Time-Series Pattern Discovery
在线阅读 下载PDF
导出
摘要 如何有效地在时间序列数据库中发现时序模式是时间序列数据挖掘中一个具有重要意义的课题.本文提出一种改进的在时间序列中有效地发现时序模式的算法.在将时间序列划分为若干等长的子序列之后,根据基于关键点的线性分段算法提取每个子序列的关键点序列,该关键点序列仅保留反映数据序列的变化模式的主要关键点.接着利用每个关键点序列分隔相应的子序列,根据数据的起伏变化将相应的关键点序列分配到一系列盒子中,使得只有在同一个盒子中的序列才有可能相似,而不同盒子中的序列不可能相似.最后通过计算每个盒子中任意两个关键点序列之间的动态时间弯曲距离来发现所有的时序模式.实验结果验证了该算法的有效性. A significant topic of time series data mining is to discover time-series patterns in time series database effectively. An improved effective algorithm for time-series pattern discovery is proposed in this paper, it divides a given sequence into several subsequences of the same length, and then a key-point series is extracted from each snbsequence by using a segmentation algorithm based on key points, only retaining the main key points which reflect its changing patterns. Separate each subsequence by its key-point series, and then distribute their key-point series into a set of boxes according to ups and downs, so that only those in the same box are possibly similar, while those in the different boxes are not. Finally all the time-series patterns will be discovered by computing Dynamic Time Warping distance between any two key-point series in each box. Experimental results show the effectiveness of the proposed algorithm.
作者 刘芬 郭躬德
出处 《漳州师范学院学报(自然科学版)》 2011年第4期27-33,共7页 Journal of ZhangZhou Teachers College(Natural Science)
关键词 时间序列 模式发现 关键点 动态时间弯曲距离 time series pattern discovery key points dynamic time warping distance
  • 相关文献

参考文献13

二级参考文献38

  • 1周黔,吴铁军.基于重要点的时间序列趋势特征提取方法[J].浙江大学学报(工学版),2007,41(11):1782-1787. 被引量:21
  • 2肖辉,胡运发.基于分段时间弯曲距离的时间序列挖掘[J].计算机研究与发展,2005,42(1):72-78. 被引量:61
  • 3潘定,沈钧毅.时态数据挖掘的相似性发现技术[J].软件学报,2007,18(2):246-258. 被引量:41
  • 4T Pavlidis, S L Horowitz. Segmentation of plane curves[J ]. Transactions on Computers, 1974,23(8):860- 870.
  • 5Kevin B Pratt, Eugene Fink. Search for patterns in compressed time series [ J ], International Journal of Image and Graphics. 2002,2(1) :89 - 106.
  • 6Sanghyun Park, Sang-wook Kim, Wesley W. Chu. Segment - based approach for subsequence searches in sequence databases [A ]. Proceedings of the 16th ACM Symposium on Applied Computing[ C]. New York: ACM Press, 21300.248 - 252.
  • 7Sanghyun Park,Dongwon Lee, Wesley W Chu. Fast retrieval of similar subsequences in long sequence databases[ A] .Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange[ C]. Washington: IEEE, Computer Society, 1999. 60-67.
  • 8Hyndman, R J(n d). Time Series Data Library(DB/OL), http://www. robhyrldman. info/TSDL, 2009-5.
  • 9黄书剑.时序数据上的数据挖掘[J].软件学报,2005,15(01):1-8.
  • 10KEOGH E.A fast and robust method for pattern matching in time series databases[C] //Proc of the 9th International Conference on Tools with Artificial Intelligence.1997:578-584.

共引文献70

同被引文献38

引证文献2

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部