戴爱明, 高学东. 时间序列三角极值点线性分段算法[J]. 南昌航空大学学报(自然科学版), 2009, 23(2): 25-28,41.
引用本文: 戴爱明, 高学东. 时间序列三角极值点线性分段算法[J]. 南昌航空大学学报(自然科学版), 2009, 23(2): 25-28,41.
shu
DAI Ai-ming, GAO Xue-dong. A Linear Segmentation Algorithm for Time Series Based on Triangle Extreme Points[J]. Journal of nanchang hangkong university(Natural science edition), 2009, 23(2): 25-28,41.
Citation: DAI Ai-ming, GAO Xue-dong. A Linear Segmentation Algorithm for Time Series Based on Triangle Extreme Points[J]. Journal of nanchang hangkong university(Natural science edition), 2009, 23(2): 25-28,41.
shu

时间序列三角极值点线性分段算法

A Linear Segmentation Algorithm for Time Series Based on Triangle Extreme Points

    摘要
  • 摘要: 文章在时间序列逐段线性描述方法基础上提出三角极值点分段算法.通过考察时间序列相邻极值点之间幅度变化大小来确定关键点序列.该算法较好地处理了时间序列局部噪声和数据压缩问题.并通过实验说明了算法的有效性.

     

    Abstract: Based on piecewise linear presentation,this article gives out the Algorithm of Triangle Extreme Points Segmentation for time series,that is,to determine the key points series by investigating the amplitude changing value between neighbor extreme points.This algorithm has well settled the partial noises and data compression,and it has been proved to be effective by an experiment.

     

    • HTML全文
    • 参考文献(4)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回