Title of article
A time series forest for classification and feature extraction
Author/Authors
Houtao Deng، نويسنده , , George Runger، نويسنده , , Eugene Tuv، نويسنده , , Martyanov Vladimir، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
12
From page
142
To page
153
Abstract
A tree-ensemble method, referred to as time series forest (TSF), is proposed for time series classification. TSF employs a combination of 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 improves the accuracy of TSF. TSF randomly samples features at each tree node and has computational complexity linear in the length of time series, and can be built using parallel computing techniques. The temporal importance curve is proposed to capture the temporal characteristics useful for classification. Experimental studies show that TSF using simple features such as mean, standard deviation and slope is computationally efficient and outperforms strong competitors such as one-nearest-neighbor classifiers with dynamic time warping.
Keywords
Decision tree , Entrance gain , Large margin , Interpretability , Time series classification , Ensemble
Journal title
Information Sciences
Serial Year
2013
Journal title
Information Sciences
Record number
1215680
Link To Document