Finding cyclic patterns on sequential data

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

Abstract

The need for the study of dynamic and evolutionary settings made time a major dimension when it comes to data analytics. From business to health applications, being able to understand temporal patterns of customers or patients can determine the ability to adapt to future changes, optimizing processes and support other decisions. In this context, different approaches to Temporal Pattern Mining have been proposed in order to capture different types of patterns able to represent evolutionary behaviors, such as regular or emerging patterns. However, these solutions still lack on quality patterns with relevant information and on efficient mining methods. In this paper we propose a new efficient sequential mining algorithm, named PrefixSpan4Cycles, for mining cyclic sequential patterns. Our experiments show that our approach is able to efficiently mine these patterns when compared to other sequential pattern mining methods. Also for datasets with a significant number of regularities, our algorithm performs efficiently, even dealing with significant constraints regarding the nature of cyclic patterns. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Barreto, A., & Antunes, C. (2014). Finding cyclic patterns on sequential data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8610 LNCS, pp. 110–121). Springer Verlag. https://doi.org/10.1007/978-3-319-09912-5_10

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