Automatic sequential pattern mining in data streams

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

Abstract

Given a large volume of multi-dimensional data streams, such as that produced by IoT applications, finance and online web-click logs, how can we discover typical patterns and compress them into compact models? In addition, how can we incrementally distinguish multiple patterns while considering the information obtained from a pattern found in a streaming setting? In this paper, we propose a streaming algorithm, namely StreamScope, that is designed to find intuitive patterns efficiently from event streams evolving over time. Our proposed method has the following properties: (a) it is effective: it operates on semi-infinite collections of co-evolving streams and summarizes all the streams into a set of multiple discrete segments grouped by their similarities. (b) it is automatic: it automatically and incrementally recognizes such patterns and generates models for each of them if necessary; (c) it is scalable: the complexity of our method does not depend on the length of the data streams. Our extensive experiments on real data streams demonstrate that StreamScope can find meaningful patterns and achieve great improvements in terms of computational time and memory space over its full batch method competitors.

Cite

CITATION STYLE

APA

Kawabata, K., Matsubara, Y., & Sakurai, Y. (2019). Automatic sequential pattern mining in data streams. In International Conference on Information and Knowledge Management, Proceedings (pp. 1733–1742). Association for Computing Machinery. https://doi.org/10.1145/3357384.3358002

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