RSP-DS: Real time sequential pattern analysis over data streams

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

Abstract

The existing pattern analysis algorithms in data streams environment have only focused on studying performance improvement and effective memory usage. But when new data streams come, existing pattern analysis algorithms have to analyze patterns again and have to regenerate pattern tree. This approach needs many calculations in real time environments having real time pattern analysis needs. This paper proposes a method that continuously analyzes patterns of incoming data streams in real time. The proposed method analyzes patterns first, and then after obtains real time patterns by updating previously analyzed patterns. The patterns form a pattern tree, and freshly created new patterns update the pattern tree. In this way, real time patterns are always maintained in the pattern tree and old patterns in the tree are deleted easily using FIFO method. The advantage of our algorithm is proved by performance comparison with existing methods, MILE, with a condition that pattern is changed continuously. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Kim, H. S., Shin, J. J., Jang, Y. I., Kim, G. B., & Bae, H. Y. (2007). RSP-DS: Real time sequential pattern analysis over data streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4537 LNCS, pp. 99–110). Springer Verlag. https://doi.org/10.1007/978-3-540-72909-9_9

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