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
Fast time series classification using numerosity reduction
Xi, X., Keogh, E., Shelton, C., Wei, L., & Ratanamahatana, C. A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143974 · Cited by 591
Making Time-series Classification More Accurate Using Learned Constraints
Ratanamahatana, C. A., & Keogh, E. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.2 · Cited by 407
Three Myths about Dynamic Time Warping Data Mining
Ratanamahatana, C. A., & Keogh, E. (2005) · Proceedings of the 2005 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.50 · Cited by 393
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
Pattern Extraction for Time Series Classification
Geurts, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44794-6_10 · Cited by 292
Feature-based classification of time-series data
Νανόπουλος, Α., Alcock, R. J., & Manolopoulos, Y. (2001) · Cited by 259
Extracting Interpretable Features for Early Classification on Time Series
Xing, Z., Pei, J., Yu, P. S., & Wang, K. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.22 · Cited by 177
Proceedings of the 2003 ACM symposium on Applied computing
(2003) · doi:10.1145/952532 · Cited by 101
Proceedings of the 2024 SIAM International Conference on Data Mining (SDM)
(2024) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611978032 · Cited by 98
Support vector machines of interval-based features for time series classification
Rodríguez, J. J., Alonso, C. J., & Maestro, J. A. (2005) · Knowledge-Based Systems · doi:10.1016/j.knosys.2004.10.007 · Cited by 90
Interval and dynamic time warping-based decision trees
Rodríguez, J. J., & Alonso, C. J. (2004) · ACM Symposium on Applied Computing · doi:10.1145/967900.968015 · Cited by 87
Early prediction on time series: a nearest neighbor approach
Xing, Z., Pei, J., & Yu, P. S. (2009) · Cited by 82
Boosting interval based literals1
Rodríguez, J. J., Alonso, C. J., & Boström, H. (2001) · Intelligent Data Analysis · doi:10.3233/ida-2001-5305 · Cited by 62
Constrained mixture estimation for analysis and robust classification of clinical time series
Costa, I. G., Schönhuth, A., Hafemeister, C., & Schliep, A. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp222 · Cited by 36
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
Classification 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
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.