The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration
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
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191925 · Cited by 1,709
Efficient time series matching by wavelets
Chan, K.-P., & Fu, A. W.-C. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754915 · Cited by 1,031
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
Self-citationFast Time Sequence Indexing for Arbitrary Lp Norms
Yi, B.-K., & Faloutsos, C. (2018) · doi:10.1184/r1/6605618 · Cited by 650
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
Agrawal, R., Lin, K.-I., Sawhney, H., & Shim, K. (1995) · Cited by 649
Rule discovery from time series
Das, G., Lin, K.-I., Mannila, H., Renganathan, G., & Smyth, P. (1998) · Cited by 637
Exact indexing of dynamic time warping
Keogh, E. (2002) · Cited by 594
Self-citationExact Indexing of Dynamic Time Warping
Keogh, E. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50043-3 · Cited by 532
Self-citationKeogh, E., & Pazzani, M. J. (1998) · Cited by 496
Self-citation
Cited by
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826
A symbolic representation of time series, with implications for streaming algorithms
Lin, J., Keogh, E., Lonardi, S., & Chiu, B. (2003) · Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery · doi:10.1145/882082.882086 · Cited by 1,799
Self-citationExperiencing 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
Self-citationStatistical and machine learning forecasting methods: Concerns and ways forward
Makridakis, S., Spiliotis, E., & Assimakopoulos, V. (2018) · PLOS ONE · doi:10.1371/journal.pone.0194889 · Cited by 1,528
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
“Yet as (Keogh and Kasetty 2003) pointed out that year, in an influential and highly cited paper, the quality of empirical evaluation tended to be very poor relative to the rest of the machine learning community.”
BackgroundSelf-citationDing, H., Trajcevski, G., Scheuermann, P., Wang, X., & Keogh, E. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454226 · Cited by 1,354
Self-citationOpenML: networked science in machine learning
Vanschoren, J., van Rijn, J. N., Bischl, B., & Torgo, L. (2014) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2641190.2641198 · Cited by 1,141
Dau, H. A., Bagnall, A., Kamgar, K., Yeh, C.-C. M., Zhu, Y., Gharghabi, S., Ratanamahatana, C. A., & Keogh, E. (2019) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2019.1911747 · Cited by 1,128
Self-citationSearching 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
Self-citationEsling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
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
Self-citationComplex network approaches to nonlinear time series analysis
Zou, Y., Donner, R. V., Marwan, N., Donges, J. F., & Kurths, J. (2019) · Physics Reports · doi:10.1016/j.physrep.2018.10.005 · Cited by 634
Clustering of time-series subsequences is meaningless: implications for previous and future research
Keogh, E., & Lin, J. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-004-0172-7 · Cited by 464
Self-citationSpatio-Temporal Data Mining: A Survey of Problems and Methods
Atluri, G., Karpatne, A., & Kumar, V. (2019) · ACM Computing Surveys · doi:10.1145/3161602 · Cited by 461
TSclust: An R Package for Time Series Clustering
Montero, P., & Vilar, J. A. (2014) · Journal of Statistical Software · doi:10.18637/jss.v062.i01 · Cited by 430
Time series shapelets: a novel technique that allows accurate, interpretable and fast classification
Ye, L., & Keogh, E. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0179-5 · Cited by 406
“” Most other state-of-the-art time series/shape classifiers do not produce interpretable results (Ding et al. 2008; Keogh and Kasetty 2002).”
BackgroundSelf-citationA 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
A Bag-of-Features Framework to Classify Time Series
Baydogan, M. G., Runger, G., & Tuv, E. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.72 · Cited by 361
Advances and opportunities in machine learning for process data analytics
Qin, S. J., & Chiang, L. H. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.04.003 · Cited by 351
Using dynamic time warping distances as features for improved time series classification
Kate, R. J. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-015-0418-x · Cited by 348
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
Generalizing DTW to the multi-dimensional case requires an adaptive approach
Shokoohi-Yekta, M., Hu, B., Jin, H., Wang, J., & Keogh, E. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0455-0 · Cited by 320
Self-citationToward Non-Intrusive Load Monitoring via Multi-Label Classification
Tabatabaei, S. M., Dick, S., & Xu, W. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2584581 · Cited by 304
A review on distance based time series classification
Abanda, A., Mori, U., & Lozano, J. A. (2019) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-018-0596-4 · Cited by 296
Forecasting and operational research: a review
Fildes, R., Nikolopoulos, K., Crone, S. F., & Syntetos, A. A. (2008) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602597 · Cited by 287
“As in forecasting, the limitations of method evaluations on toy-datasets to derive best practices have been identified within DM (Keogh and Kasetty, 2003), with an increasing emphasis on ‘meta-learning’ (SmithMiles, 2008).”
MethodLogical-shapelets: an expressive primitive for time series classification
Mueen, A., Keogh, E., & Young, N. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020587 · Cited by 282
Self-citationHierarchical Clustering of Time-Series Data Streams
Rodrigues, P. P., Gama, J., & Pedroso, J. P. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190727 · Cited by 260
DeepMood: Modeling Mobile Phone Typing Dynamics for Mood Detection
Cao, B., Zheng, L., Zhang, C., Yu, P. S., Piscitello, A., Zulueta, J., Ajilore, O., Ryan, K., & Leow, A. D. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098086 · Cited by 145
“Distance based methods include K nearest neighbor classifier [16, 26, 27, 38, 47, 49] and SVMwith local alignment kernel [32, 41, 42] by measuring the similarity between a pair of sequences.”
MethodPhysical Activity Recognition from Accelerometer Data Using a Multi-Scale Ensemble Method
Zheng, Y., Won, W.-K., Guan, X., & Trost, S. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i2.18997 · Cited by 84
Wu, F., & Zhao, J. (2017) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2016.2587339 · Cited by 82
Ramirez, E., Wimmer, M., & Atzmueller, M. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-37446-4_11 · Cited by 17
Metadata
- Authors
- Keogh, E., & Kasetty, S.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2003-10
- Volume
- 7
- Issue
- 4
- Pages
- 349-371
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W1853995153
- Cited by
- 861
- References
- 42
- FWCI
- 24.96
- Type
- journal article
- Language
- en
- Open access
- closed
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.