arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.2277cs.LG
收藏

用于分类和特征提取的时间序列森林

A Time Series Forest for Classification and Feature Extraction

Arizona State University(亚利桑那州立大学);Intel(英特尔)

Houtao Deng, George Runger, Eugene Tuv, Martyanov Vladimir

摘要:

我们提出了一个树集成方法,称为时间序列森林(TSF),时间序列分类。TSF采用熵增益和距离测量的组合,称为入口(熵和距离)增益,用于评估分裂。实验研究表明,入口增益准则提高了TSF的精度。TSF在每个树节点处随机采样特征,并且具有与时间序列的长度成线性关系的计算复杂性,并且可以使用并行计算技术(例如,这里使用的多核计算)来构建。还提出了时间重要性曲线来捕获对分类有用的重要时间特征。实验研究表明,TSF使用简单的功能,如平均值,偏差和斜率优于强大的竞争对手,如一个最近邻分类器与动态时间扭曲,是计算效率高,并可以提供洞察的时间特性。

英文摘要:

We propose a tree ensemble method, referred to as time series forest (TSF), for time series classification. TSF employs a combination of the entropy gain and a distance measure, referred to as the Entrance (entropy and distance) gain, for evaluating the splits. Experimental studies show that the Entrance gain criterion improves the accuracy of TSF. TSF randomly samples features at each tree node and has a computational complexity linear in the length of a time series and can be built using parallel computing techniques such as multi-core computing used here. The temporal importance curve is also proposed to capture the important temporal characteristics useful for classification. Experimental studies show that TSF using simple features such as mean, deviation and slope outperforms strong competitors such as one-nearest-neighbor classifiers with dynamic time warping, is computationally efficient, and can provide insights into the temporal characteristics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑