The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A PCA-based similarity measure for multivariate time series
Abstract
Multivariate time series (MTS) datasets are common in various multimedia, medical and financial applications. We propose a similarity measure for MTS datasets, Eros Extended Frobenius norm), which is based on Principal Component Analysis (PCA). Eros applies PCA to MTS datasets represented as matrices to generate principal components and associated eigenvalues. These principal components and eigenvalues are then used to compare the similarity between MTS matrices. Though Eros in itself does not satisfy the triangle inequality, without which existing multidimensional indexing structures may not be utilized, the lower and upper bounds to satisfy the triangle inequality are obtained. In order to show the validity of Eros for similarity search on MTS datasets, we performed several experiments on three datasets (2 real-world and 1 synthetic). The results show the superiority of our approaches as compared to the traditional similarity measures for MTS datasets, such as Euclidean Distance (ED), Dynamic Time Warping (DTW), Weighted Sum SVD (WSSVD) and PCA similarity factor (SPCA) in precision/recall.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
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
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
A User's Guide to Principal Components
Leigh, S., & Jackson, J. E. (1993) · Technometrics · doi:10.2307/1269292 · Cited by 3,332
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,757
A Use's Guide to Principal Components
Jackson, J. E. (1991) · Wiley Series in Probability and Statistics · doi:10.1002/0471725331 · Cited by 2,516
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
Mathematical Methods and Algorithms for Signal Processing
Moon, T. K., & Stirling, W. C. (1999) · Cited by 1,491
Discovering 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
Chávez, E., Navarro, G., Baeza-Yates, R., & Marroquín, J. L. (2001) · ACM Computing Surveys · doi:10.1145/502807.502808 · Cited by 1,246
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
Böhm, C., Berchtold, S., & Keim, D. A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502809 · Cited by 827
Detecting Change in Data Streams
Kifer, D., Ben-David, S., & Gehrke, J. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50019-x · Cited by 789
Exact indexing of dynamic time warping
Keogh, E. (2002) · Cited by 594
Performance tradeoffs in dynamic time warping algorithms for isolated word recognition
Myers, C., Rabiner, L., & Rosenberg, A. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163491 · Cited by 568
Between-Groups Comparison of Principal Components
Krzanowski, W. J. (1979) · Journal of the American Statistical Association · doi:10.1080/01621459.1979.10481674 · Cited by 533
On Clustering fMRI Time Series
Goutte, C., Toft, P., Rostrup, E., Nielsen, F. Å., & Hansen, L. K. (1999) · NeuroImage · doi:10.1006/nimg.1998.0391 · Cited by 518
Incremental Singular Value Decomposition of Uncertain Data with Missing Values
Brand, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_47 · Cited by 493
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
A compact and efficient image retrieval approach based on border/interior pixel classification
Stehling, R. O., Nascimento, M. A., & Falcão, A. X. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584812 · Cited by 302
Indexing the Distance: An Efficient Method to KNN Processing
Cui, Y. J., Ooi, B. C., Tan, K., & Jagadish, H. V. (2001) · Cited by 281
Event related potentials during object recognition tasks
Zhang, X. L., Begleiter, H., Porjesz, B., Wang, W., & Litke, A. (1995) · Brain Research Bulletin · doi:10.1016/0361-9230(95)02023-5 · Cited by 273
A 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
Temporal classification : extending the classification paradigm to multivariate time series
Kadous, M. W. (2022) · doi:10.26190/unsworks/8829 · Cited by 186
Discovering clusters in motion time-series data
Alon, J., Sclaroff, S., Kollios, G., & Pavlovic, V. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211378 · Cited by 185
Dynamic time warping for off-line recognition of a small gesture vocabulary
Corradini, A. (2002) · Proceedings IEEE ICCV Workshop on Recognition, Analysis, and Tracking of Faces and Gestures in Real-Time Systems · doi:10.1109/ratfg.2001.938914 · Cited by 173
Discovery of climate indices using clustering
Steinbach, M. S., Tan, P., Kumar, V., Klooster, S. A., & Potter, C. S. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956801 · Cited by 148
Performance Analysis of Time-Distance Gait Parameters under Different Speeds
Tanawongsuwan, R., & Bobick, A. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44887-x_83 · Cited by 76
Lower-Bounding of Dynamic Time Warping Distances for Multivariate Time Series
Rath, T. M., & Manmatha, R. (2003) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 67
Plant diagnostics by transient classification: The ALADDIN approach
Roverso, D. (2002) · International Journal of Intelligent Systems · doi:10.1002/int.10049 · Cited by 48
Cited by
ASD-DiagNet: A Hybrid Learning Approach for Detection of Autism Spectrum Disorder Using fMRI Data
Eslami, T., Mirjalili, V., Fong, A., Laird, A. R., & Saeed, F. (2019) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2019.00070 · Cited by 379
Evaluation of k-nearest neighbour classifier performance for heterogeneous data sets
Ali, N., Neagu, D., & Trundle, P. (2019) · SN Applied Sciences · doi:10.1007/s42452-019-1356-9 · Cited by 274
Metadata
- Authors
- Yang, K., & Shahabi, C.
- Venue
- Proceedings of the 2nd ACM international workshop on Multimedia databases
- Publisher
- ACM
- Published
- 2004-11-13
- Pages
- 65-74
- OpenAlex
- W2018546346
- Cited by
- 276
- References
- 31
- FWCI
- 5.30
- Type
- conference paper
- 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.