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-citationEvent detection from time series data
Guralnik, V., & Srivastava, J. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312190 · Cited by 474
Distance measures for effective clustering of ARIMA time-series
Kalpakis, K., Gada, D., & Puttagunta, V. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989529 · Cited by 442
Efficiently supporting ad hoc queries in large datasets of time sequences
Korn, F., Jagadish, H. V., & Faloutsos, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253332 · Cited by 405
Finding patterns in time series: a dynamic programming approach
Berndt, D. J., & Clifford, J. (1996) · Knowledge Discovery and Data Mining · Cited by 331
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
Similarity search over time-series data using wavelets
Popivanov, I., & Miller, R. J. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994711 · Cited by 280
Approximate queries and representations for large data sequences
Shatkay, H., & Zdonik, S. B. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1996.492204 · Cited by 263
A probabilistic approach to fast pattern matching in time series databases
Keogh, E., & Smyth, P. (1997) · Knowledge Discovery and Data Mining · Cited by 254
Self-citationA comparison of DFT and DWT based similarity search in time-series databases
Wu, Y.-L., Agrawal, D., & El Abbadi, A. (2000) · Proceedings of the ninth international conference on Information and knowledge management · doi:10.1145/354756.354857 · Cited by 253
Agrawal, R., Psaila, G., Wimmers, E. L., & Zaït, M. (1995) · Cited by 251
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches
Indyk, P., Koudas, N., & Muthukrishnan, S. (2000) · Very Large Data Bases · Cited by 208
Machine learning as an experimental science
Langley, P. (1988) · Machine Learning · doi:10.1007/bf00115008 · Cited by 187
Mining the stock market (extended abstract): which measure is best?
Gavrilov, M., Anguelov, D., Indyk, P., & Motwani, R. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347189 · Cited by 180
Deformable Markov model templates for time-series pattern matching
Ge, X., & Smyth, P. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347109 · Cited by 178
Similarity search for multidimensional data sequences
Lee, S., Chun, S.-J., Kim, D., et al. (2002) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2000.839473 · Cited by 155
Variable length queries for time series data
Kahveci, T., & Singh, A. K. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2001.914838 · Cited by 146
SEARCH FOR PATTERNS IN COMPRESSED TIME SERIES
Pratt, K., & Fink, E. (2002) · International Journal of Image and Graphics · doi:10.1142/s0219467802000482 · Cited by 145
The Haar Wavelet Transform in the Time Series Similarity Paradigm
Struzik, Z. R., & Siebes, A. P. J. M. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-48247-5_2 · Cited by 133
Shahabi, C., Tian, X., & Zhao, W. (2002) · International Conference on Scientific and Statistical Database Management · doi:10.1109/ssdm.2000.869778 · Cited by 121
Approximate nearest neighbor searching in multimedia databases
Ferhatosmanoğlu, H., Tuncel, E., Agrawal, D., & Abbadi, A. E. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2001.914864 · Cited by 112
Adaptive query processing for time-series data
Huang, Y.-W., & Yu, P. S. (1999) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/312129.318357 · Cited by 105
Supporting content-based searches on time series via approximation
Wang, C., & Wang, X. S. (2002) · International Conference on Scientific and Statistical Database Management · doi:10.1109/ssdm.2000.869779 · Cited by 99
Using signature files for querying time-series data
André-Jönsson, H., & Badal, D. Z. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63223-9_120 · Cited by 93
Segment-based approach for subsequence searches in sequence databases
Park, S., Kim, S., & Chu, W. W. (2001) · ACM Symposium on Applied Computing · doi:10.1145/372202.372334 · Cited by 92
Fast retrieval of similar subsequences in long sequence databases
Park, S., Lee, D., & Chu, W. W. (2003) · doi:10.1109/kdex.1999.836610 · Cited by 86
Efficient Pruning Methods for Separate-and-Conquer Rule Learning Systems.
Cohen, W. W. (1993) · Cited by 83
Li, C., Yu, P. S., & Castelli, V. (1998) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/288627.288666 · Cited by 78
Supporting fast search in time series for movement patterns in multiple scales
Qu, Y., Wang, C., & Wang, X. S. (1998) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/288627.288664 · Cited by 76
Mining for similarities in aligned time series using wavelets
Huhtala, Y., Kärkkäinen, J., & Toivonen, H. T. T. (1999) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.339977 · Cited by 44
A similarity search method of time series data with combination of Fourier and wavelet transforms
Kawagoe, K., & Ueda, T. (2003) · International Symposium on Temporal Representation and Reasoning · doi:10.1109/time.2002.1027480 · Cited by 34
Efficient and robust feature extraction and pattern matching of time series by a lattice structure
Man, P. W. P., & Wong, M. H. (2001) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/502585.502631 · Cited by 20
AIM: Approximate Intelligent Matching for Time Series Data
Kim, E.-M., Lam, J. M. W., & Han, J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44466-1_35 · Cited by 10
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
Self-citation
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.