期刊文献+

基于角点弯曲度的时间序列相似性搜索算法 被引量:5

Time Series Similarity Search Algorithm Based on Bending Degree of Angular Point
下载PDF
导出
摘要 针对基于点距离的时间序列相似性搜索算法鲁棒性较差的问题,提出一种面向形态的时间序列近似表示方法和相似性度量算法。算法不依赖于时间序列长度和领域知识。在充分利用时间序列时变特征的基础上,以角点为分界点,利用角点处的弯曲度提取时间序列的特征,近似表示时间序列。实验结果表明,该算法具有良好的平移和伸缩不变性及较好的鲁棒性,搜索能力更强。 Aiming at the lack of similar sub-patterns discovery algorithm from time series based on points distance such as poor robustness, an algorithm is proposed for similarity measure and approximate representation of time series based on morphological character. Fully used the time-varying characteristics, time series are divided by angular points, and its characters are extracted with bending degrees at angular points to approximate the time series. The algorithm does not depend on the length of time series and domain knowledge. Experimental results show that this algorithm is not only invariant to translation and scalability, but has good robustness, and the results are more effective.
作者 张雪丽 牛强
出处 《计算机工程》 CAS CSCD 北大核心 2011年第15期37-39,54,共4页 Computer Engineering
基金 国家自然科学基金资助项目(50674086)
关键词 时间序列 相似性搜索 角点弯曲度 形态特征 平滑 time series similarity search bending degree of angular point morphological characteristic smooth
  • 相关文献

参考文献7

二级参考文献32

  • 1周黔,吴铁军.基于重要点的时间序列趋势特征提取方法[J].浙江大学学报(工学版),2007,41(11):1782-1787. 被引量:19
  • 2潘定,沈钧毅.时态数据挖掘的相似性发现技术[J].软件学报,2007,18(2):246-258. 被引量:41
  • 3张建业,潘泉,张鹏,梁建海.基于斜率表示的时间序列相似性度量方法[J].模式识别与人工智能,2007,20(2):271-274. 被引量:36
  • 4CHEN M S, HAN Jia-wei,YU P S. Data mining: an overview from a database perspective [ J]. IEEE Trans on Knowledge and Data Engineering, 1996,8(6) :866-883.
  • 5SIDIROPOULOS N D,BROS R. Mathematical programming algorithms for regression-based non-linear filtering in n-dimensional real space [J]. IEEE Trans on Signal Processing,1999,47(3) :771-782.
  • 6AGRAWAL R,LIN K I,SAWHNEY H S, et al. Fast similarity search in the presence of noise, scaling, and translation in time-series database[ C ]//Proc of the 21st International Conference on Very Large Data Bases. San Francisco:Morgan Kaufmann Publishers, 1995:490- 501.
  • 7BERNDT D J, CLIFFORD J. Using dynamic time warping to find patterns in time series [ C ]//Proc of KDD Workshop. 1994:359- 370.
  • 8FALOUTSOS C, RANGANATHAN M, MANOLOPOULOS Y. Fast subsequence matching in time series databases[ C]//Proc of ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 1994:419-429.
  • 9BAYER K, COLDSTEIN J, RANIAKRISHNAN R, et al. When is “nearest neighbors” meaningful [ C ]//Proc of the 7th International Conference on Database Theory. Berlin:Springer, 1999:217-235.
  • 10KEOGH E J, PAZZANI M J. An indexing scheme for fast similarity search in large time series databases[ C]//Proc of the llth International Conference on Scientific & Statistical Database Management. Washington DC : IEEE Computer Society, 1999:56-67.

共引文献90

同被引文献62

引证文献5

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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