Rotation-invariant similarity in time series using bag-of-patterns representation
The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
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
(1967) · Cited by 23,719
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
A vector space model for automatic indexing
Salton, G., Wong, A., & Yang, C. S. (1975) · Communications of the ACM · doi:10.1145/361219.361220 · Cited by 7,521 · cited 1×
“In the Vector Space Model (Salton et al. 1975), each document can be represented as a vector.”
BackgroundHierarchical Clustering Schemes
Johnson, S. C. (1967) · Psychometrika · doi:10.1007/bf02289588 · Cited by 4,897
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2019) · Texts in Computer Science · doi:10.1007/978-3-030-11298-1 · Cited by 3,681
Gralton, B. (2008) · Art monthly Australia · Cited by 3,001
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
Exact indexing of dynamic time warping
Keogh, E., & Ratanamahatana, C. A. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-004-0154-9 · Cited by 1,962
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
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 · cited 6×
“To tackle both challenges, we use a simple sliding window scheme, and adapt the widely used symbolic representation for time series, SAX (Symbolic Aggregate approXimation) (Lin et al. 2007).”
BackgroundMethodInfluentialSelf-citationDiscovering similar multidimensional trajectories
Vlachos, M., Kollios, G., & Gunopulos, D. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994784 · Cited by 1,468
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
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
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 Marriage of Lp-norms and Edit Distance
Chen, L., & Ng, R. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50070-x · Cited by 774
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · ACM SIGMOD Record · doi:10.1145/191843.191925 · Cited by 722
Scaling clustering algorithms to large databases
Bradley, P., Fayyad, U. M., & Reina, C. (1998) · Cited by 716
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
Exact indexing of dynamic time warping
Keogh, E. (2002) · Cited by 594
Tai, B. Y. T. (2003) · International Journal of Constitutional Law · doi:10.1093/icon/1.1.147 · Cited by 584
Towards parameter-free data mining
Keogh, E., Lonardi, S., & Ratanamahatana, C. A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014077 · Cited by 567
Exact 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
On the need for time series data mining benchmarks: a survey and empirical demonstration
Keogh, E., & Kasetty, S. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775062 · Cited by 442
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
Generalized feature extraction for structural pattern recognition in time-series data
Olszewski, R., Maxion, R. A., & Siewiorek, D. P. (2001) · Cited by 387
Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching
Marteau, P.-F. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.76 · Cited by 335
Locally adaptive dimensionality reduction for indexing large time series databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · ACM SIGMOD Record · doi:10.1145/376284.375680 · Cited by 296
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
Logical-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
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
Finding the most unusual time series subsequence: algorithms and applications
Keogh, E., Lin, J., Lee, S.-H., & Herle, H. V. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0034-6 · Cited by 228
Self-citationKeogh, E., Li, W., Xi, X., Lee, S., & Vlachos, M. (2006) · doi:10.5555/1182635.1164203 · Cited by 197
Iterative Incremental Clustering of Time Series
Lin, J., Vlachos, M., Keogh, E., & Gunopulos, D. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24741-8_8 · Cited by 192
Self-citationSpeeding up two string-matching algorithms
Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., & Rytter, W. (1994) · Algorithmica · doi:10.1007/bf01185427 · 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
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
Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs
Sart, D., Mueen, A., Najjar, W. A., Keogh, E., & Niennattrakul, V. (2010) · Proceedings · doi:10.1109/icdm.2010.21 · Cited by 137
Sengupta, J. K. (1993) · Springer eBooks · doi:10.1007/978-94-015-8202-5_1 · Cited by 115
Finding Structural Similarity in Time Series Data Using Bag-of-Patterns Representation
Lin, J., & Li, Y. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02279-1_33 · Cited by 113
Self-citationSAXually Explicit Images: Finding Unusual Shapes
Li, W., Keogh, E., & Xi, X. (2006) · Proceedings · doi:10.1109/icdm.2006.138 · Cited by 100
Time-Series Classification in Many Intrinsic Dimensions
Radovanović, M., Nanopoulos, A., & Ivanović, M. (2010) · Proceedings of the 2010 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.59 · Cited by 72
Online Context Recognition in Multisensor Systems using Dynamic Time Warping
Ko, M. H., West, G., Venkatesh, S., & Kumar, M. (2005) · 2005 International Conference on Intelligent Sensors, Sensor Networks and Information Processing · doi:10.1109/issnip.2005.1595593 · Cited by 54
Approximate Clustering of Time Series Using Compact Model-Based Descriptions
Kriegel, H., Kröger, P., Pryakhin, A., Renz, M., & Zherdin, A. (2008) · Springer eBooks · doi:10.1007/978-3-540-78568-2_27 · Cited by 7
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
“OurBOP results are not significantly different to the publishedones.”
BackgroundInfluentialThe BOSS is concerned with time series classification in the presence of noise
Schäfer, P. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0377-7 · Cited by 560
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
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
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
Metadata
- Authors
- Lin, J., Khade, R., & Li, Y.
- Venue
- Journal of Intelligent Information Systems
- Published
- 2012-04-01
- Volume
- 39
- Issue
- 2
- Pages
- 287-315
- ISSN
- 0925-9902 (ISSN-L)
- 1573-7675
- OpenAlex
- W2141536962
- Cited by
- 295
- References
- 48
- FWCI
- 20.68
- 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.