The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Highly Comparative Feature-Based Time-Series Classification
Open accessAbstract
A highly comparative, feature-based approach to time series classification is introduced that uses an extensive database of algorithms to extract thousands of interpretable features from time series. These features are derived from across the scientific time-series analysis literature, and include summaries of time series in terms of their correlation structure, distribution, entropy, stationarity, scaling properties, and fits to a range of time-series models. After computing thousands of features for each time series in a training set, those that are most informative of the class structure are selected using greedy forward feature selection with a linear classifier. The resulting feature-based classifiers automatically learn the differences between classes using a reduced number of time-series properties, and circumvent the need to calculate distances between time series. Representing time series in this way results in orders of magnitude of dimensionality reduction, allowing the method to perform well on very large data sets containing long time series or time series of different lengths. For many of the data sets studied, classification performance exceeded that of conventional instance-based classifiers, including one nearest neighbor classifiers using euclidean distances and dynamic time warping and, most importantly, the features selected provide an understanding of the properties of the data set, insight that can guide further scientific investigation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
John Lu, Z. Q. (2010) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2010.00646_6.x · Cited by 12,390
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
Statistical pattern recognition: a review
Jain, A. K., Duin, P. W., & Mao, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824819 · Cited by 6,767
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
(1994) · Knowledge Discovery and Data Mining · Cited by 3,137
Nonlinear Time Series Analysis
Kantz, H., & Schreiber, T. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511755798 · Cited by 2,629
Clustering of time series data—a survey
Warren Liao, T. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.01.025 · Cited by 2,401
Nonlinear Time Series Analysis
(2005) · Technometrics · doi:10.1198/tech.2005.s306 · Cited by 2,109
Experiencing SAX: A novel symbolic representation of time series
Lin, J., Keogh, E., Wei, L., & Lonardi, S. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-007-0064-z · Cited by 1,618
Data Clustering: Theory, Algorithms, and Applications
Gan, G., Ma, C., & Wu, J. (2007) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718348 · Cited by 1,562
Schreiber, T., & Schmitz, A. (2000) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(00)00043-9 · Cited by 1,514
Ding, H., Trajcevski, G., Scheuermann, P., Wang, X., & Keogh, E. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454226 · Cited by 1,354
Schreiber, T., & Schmitz, A. (1999) · Cited by 1,276
Searching and mining trillions of time series subsequences under dynamic time warping
Rakthanmanon, T., Campana, B., Mueen, A., Batista, G., Westover, B., Zhu, Q., Zakaria, J., & Keogh, E. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339576 · Cited by 1,047
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
Locally adaptive dimensionality reduction for indexing large time series databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375680 · Cited by 866
On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration
Keogh, E., & Kasetty, S. (2003) · Data Mining and Knowledge Discovery · doi:10.1023/a:1024988512476 · Cited by 861
Experimental comparison of representation methods and distance measures for time series data
Wang, X., Mueen, A., Ding, H., Trajcevski, G., Scheuermann, P., & Keogh, E. (2013) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0250-5 · Cited by 845
Characteristic-Based Clustering for Time Series Data
Wang, X., Smith, K., & Hyndman, R. (2006) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0039-x · Cited by 679
A time series forest for classification and feature extraction
Deng, H., Runger, G., Tuv, E., & Vladimir, M. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.030 · Cited by 635
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
Locally adaptive dimensionality reduction for indexing large time series databases
Chakrabarti, K., Keogh, E., Mehrotra, S., & Pazzani, M. (2002) · ACM Transactions on Database Systems · doi:10.1145/568518.568520 · Cited by 407
Fast Shapelets: A Scalable Algorithm for Discovering Time Series Shapelets
Rakthanmanon, T., & Keogh, E. (2013) · Proceedings of the 2013 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.74 · Cited by 388
Highly comparative time-series analysis: the empirical structure of time series and their methods
Fulcher, B. D., Little, M. A., & Jones, N. S. (2013) · Journal of The Royal Society Interface · doi:10.1098/rsif.2013.0048 · Cited by 352
Self-citationA Complexity-Invariant Distance Measure for Time Series
Batista, G. E. A. P. A., Wang, X., & Keogh, E. J. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.60 · Cited by 329
Highly comparative time-series analysis: the empirical structure of time series and their methodsPreprint
Fulcher, B., Little, M. A., & Jones, N. S. (2013) · Cited by 325
Self-citationi SAX: indexing and mining terabyte sized time series
Shieh, J., & Keogh, E. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401966 · Cited by 323
Computer Vision Classification of Leaves from Swedish Trees
Söderkvist, O. J. O. (2001) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 288
Semi-supervised time series classification
Wei, L., & Keogh, E. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150498 · Cited by 282
Feature-based classification of time-series data
Νανόπουλος, Α., Alcock, R. J., & Manolopoulos, Y. (2001) · Cited by 259
Generalized feature extraction for structural pattern recognition in time-series data
Olszewski, R., Maxion, R. A., & Siewiorek, D. P. (2001) · Cited by 254
Mitsa, T. (2010) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420089776 · Cited by 223
Characteristics of hand tremor time series
Timmer, J., Gantert, C., Deuschl, G., & Honerkamp, J. (1993) · Biological Cybernetics · doi:10.1007/bf00202568 · Cited by 112
Structure-Based Statistical Features and Multivariate Time Series Clustering
Wang, X., Wirth, A. I., & Wang, L. (2007) · Proceedings · doi:10.1109/icdm.2007.103 · Cited by 96
Guyon, I., Aliferis, C., & Elissee., A. ́. (2007) · Chapman & Hall/CRC data mining and knowledge discovery series · doi:10.1201/9781584888796.ch4 · Cited by 93
Guyon, C. A. I. (2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796-11 · Cited by 80
Book Review: "Nonlinear Time Series Analysis, 2nd Edition" by Holger Kantz and Thomas Schreiber
Jánosi, I. M. (2004) · Fractals · doi:10.1142/s0218348x04002616 · Cited by 66
Cited by
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
Forecasting: theory and practice
Petropoulos, F., Apiletti, D., Assimakopoulos, V., Babai, M. Z., Barrow, D. K., Ben Taieb, S., Bergmeir, C., Bessa, R. J., Bijak, J., Boylan, J. E., et al. (2022) · International Journal of Forecasting · doi:10.1016/j.ijforecast.2021.11.001 · Cited by 921
Bandara, K., Bergmeir, C., & Smyl, S. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112896 · Cited by 435
Lubba, C. H., Sethi, S. S., Knaute, P., Schultz, S. R., Fulcher, B. D., & Jones, N. S. (2019) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-019-00647-x · Cited by 431
Self-citationTime-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
Metadata
- Authors
- Fulcher, B. D., & Jones, N. S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2014-12-01
- Volume
- 26
- Issue
- 12
- Pages
- 3026-3037
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2009082127
- Cited by
- 343
- References
- 42
- FWCI
- 22.84
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.