A K-Motifs discovery approach for large time-series data analysis

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Motif discovery is a method for finding some previously unknown but frequently appearing patterns in time series. However, the high dimensionality and dynamic uncertainty of time series data lead to the main challenge for searching accuracy and effectiveness. In our paper, we propose a novel k-motifs discovery approach based on the Piecewise Linear Representation and the Skyline index, which is superior to traditional R-tree index. As the experimental results suggest, our approach is more accurate and effective than some other traditional methods.

Cite

CITATION STYLE

APA

Hu, Y., Ji, C., Jing, M., & Li, X. (2016). A K-Motifs discovery approach for large time-series data analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9932 LNCS, pp. 492–496). Springer Verlag. https://doi.org/10.1007/978-3-319-45817-5_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free