检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:林意[1] 孔斌强 LIN Yi;KONG Binqiang(College of Digital and Media, Jiangnan University, Wuxi, Jiangsu 214122, China)
出 处:《计算机工程与应用》2016年第21期81-87,共7页Computer Engineering and Applications
摘 要:针对目前的时间序列线性表示方法多采用启发式方法提取局部特征点作为分段点,容易陷入局部最优化,不能很好地表示时间序列全局特征,而且多采用单一的拟合误差作为阈值,不能准确预计分段数量,不利于后期进行的时间序列分析应用的问题。提出了一种新的固定分段数的表示方法——PLR_BTBU,首先根据二叉树层次遍历的思想,提取时间序列全局特征点将时间序列初始分段,再通过斜率变化特征将整个时间序列符号化,以各初始分段内的符号特征来确定各初始分段中的分段点分布,最后采用一种改进的固定分段数的自底向上融合算法,将各个子序列逐步融合到要求的分段数。实验结果表明,与已有的方法相比,该方法不仅较好地保留时间序列的全局特征,而且拟合后的时间序列和原时间序列之间的拟合误差更小。Current piecewise linear representation methods just use heuristics method to extract the local feature points as the piecewise points. It usually falls into local optimization and cannot represent the global feature of the series very well.Besides, it usually uses the fitting error as the single threshold that cannot accurately predict the number of the sections.These methods cannot meet the application of time series analysis in late. This paper proposes a new representation method—PLR_BTBU which is based on the fixed section number method. The proposed method firstly uses the binary tree-traversal level method to divide the series into rough segments. Then, it uses the slope change characteristics to symbol the whole series. After that, the symbolic feature segments are initially used to determine the distribution of the piecewise points in each initial segment. Finally, an improved BU algorithm is used to fuse each sub sequence to the segment number. The experimental results show that the proposed method not only can preserve the global feature of time series, but also can get a smaller fitting error between the original time series and the new series compared with other algorithms.
关 键 词:时间序列 分段线性表示 二叉树层次遍历 符号化 自底向上
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222