DWFIST: Leveraging calendar-based pattern mining in data streams

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

Abstract

Calendar-based pattern mining aims at identifying patterns on specific calendar partitions. Potential calendar partitions are for example: every Monday, every first working day of each month, every holiday. Providing flexible mining capabilities for calendar-based partitions is especially challenging in a data stream scenario. The calendar partitions of interest are not known a priori and at each point in time only a subset of the detailed data is available. We show how a data warehouse approach can be applied to this problem. The data warehouse that keeps track of frequent itemsets holding on different partitions of the original stream has low storage requirements. Nevertheless, it allows to derive sets of patterns that are complete and precise. This work demonstrates the effectiveness of our approach by a series of experiments. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Monteiro, R. S., Zimbrão, G., Schwarz, H., Mitschang, B., & De Souza, J. M. (2007). DWFIST: Leveraging calendar-based pattern mining in data streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4654 LNCS, pp. 438–448). Springer Verlag. https://doi.org/10.1007/978-3-540-74553-2_41

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