The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
A time series forest for classification and feature extraction
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Individual Comparisons by Ranking Methods
Wilcoxon, F. (1945) · Biometrics Bulletin · doi:10.2307/3001968 · Cited by 15,354
Witten, I. H. (2008) · Cited by 9,143
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
Multiple comparisons among means
Dunn, O. J. (1961) · Journal of the American Statistical Association · doi:10.1080/01621459.1961.10482090 · Cited by 5,006
A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
Friedman, M. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731944 · Cited by 2,785
Statistical Comparisons of Classifiers over Multiple Data Sets
DemšarJanez (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248548 · Cited by 1,074
Time series shapelets: a new primitive for data mining
Ye, L., & Keogh, E. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557122 · Cited by 987
Weighted dynamic time warping for time series classification
Jeong, Y.-S., Jeong, M. K., & Omitaomu, O. A. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.022 · Cited by 695
Cited by
Deep learning for time series classification: a review
Ismail Fawaz, H., Forestier, G., Weber, J., Idoumghar, L., & Muller, P.-A. (2019) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-019-00619-1 · Cited by 3,342
Sagi, O., & Rokach, L. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1249 · Cited by 3,103
Bagnall, A., Lines, J., Bostrom, A., Large, J., & Keogh, E. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0483-9 · Cited by 1,377
“Deng et al. (2013) overcome the problem of the huge interval feature space by employing a random forest approach, using summary statistics of each interval as features.”
MethodClassification of time series by shapelet transformation
Hills, J., Lines, J., Baranauskas, E., Mapp, J., & Bagnall, A. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-013-0322-1 · Cited by 538
Time series classification with ensembles of elastic distance measures
Lines, J., & Bagnall, A. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0361-2 · Cited by 522
Ruiz, A. P., Flynn, M., Large, J., Middlehurst, M., & Bagnall, A. (2021) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-020-00727-3 · Cited by 476
Decision forest: Twenty years of research
Rokach, L. (2016) · Information Fusion · doi:10.1016/j.inffus.2015.06.005 · Cited by 472
Time-Series Classification with COTE: The Collective of Transformation-Based Ensembles
Bagnall, A., Lines, J., Hills, J., & Bostrom, A. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2416723 · Cited by 416
A shapelet transform for time series classification
Lines, J., Davis, L. M., Hills, J., & Bagnall, A. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339579 · Cited by 368
Highly Comparative Feature-Based Time-Series Classification
Fulcher, B. D., & Jones, N. S. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2316504 · Cited by 343
Lines, J., Taylor, S., & Bagnall, A. (2018) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3182382 · Cited by 333
HIVE-COTE 2.0: a new meta ensemble for time series classification
Middlehurst, M., Large, J., Flynn, M., Lines, J., Bostrom, A., & Bagnall, A. (2021) · Machine Learning · doi:10.1007/s10994-021-06057-9 · Cited by 321
shapeDTW: Shape Dynamic Time Warping
Zhao, J., & Itti, L. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.09.020 · Cited by 281
Deep Learning for Time Series Classification and Extrinsic Regression: A Current Survey
Mohammadi Foumani, N., Miller, L., Tan, C. W., Webb, G. I., Forestier, G., & Salehi, M. (2024) · ACM Computing Surveys · doi:10.1145/3649448 · Cited by 268
Fritz, B. A., Chen, Y., Murray-Torres, T. M., Gregory, S., Ben Abdallah, A., Kronzer, A., McKinnon, S. L., Budelier, T., Helsten, D. L., Wildes, T. S., et al. (2018) · BMJ Open · doi:10.1136/bmjopen-2017-020124 · Cited by 42
Explainable Time Series Tweaking via Irreversible and Reversible Temporal Transformations
Karlsson, I., Rebane, J., Papapetrou, P., & Gionis, A. (2018) · 2018 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2018.00036 · Cited by 31
(2023) · doi:10.1007/s00170-023-12692-4 · Cited by 6
A Novel Multi-Centroid Template Matching Algorithm and Its Application to Cough Detection
Zhang, S., Nemati, E., Ahmed, T., Rahman, M. M., Kuang, J., & Gao, A. (2021) · 2021 43rd Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC) · doi:10.1109/embc46164.2021.9629993 · Cited by 5
Metadata
- Authors
- Deng, H., Runger, G., Tuv, E., & Vladimir, M.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2013-08
- Volume
- 239
- Pages
- 142-153
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2166547175
- Cited by
- 635
- References
- 25
- FWCI
- 21.28
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.