Abstract
The problem of discovering episode rules from static databases has been studied for years due to its wide applications in prediction. In this paper, we make the first attempt to study a special episode rule, named serial episode rule with a time lag in an environment of multiple data streams. This rule can be widely used in different applications, such as traffic monitoring over multiple car passing streams in highways. Mining serial episode rules over the data stream environment is a challenge due to the high data arrival rates and the infinite length of the data streams. In this paper, we propose two methods considering different criteria on space utilization and precision to solve the problem by using a prefix tree to summarize the data streams and then traversing the prefix tree to generate the rules. A series of experiments on real data is performed to evaluate the two methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: VLDB 1994, pp. 487–499 (1994)
Hall, F.L.: Traffic stream characteristics. In: Traffic Flow Theory, U.S. Federal Highway Administration (1996)
Harms, S.K., Deogun, J.S.: Sequential Association Rule Mining with Time Lags. Journal of Intelligent Information Systems 22(1), 7–22 (2004)
Harms, S.K., Deogun, J., Saquer, J., Tadesse, T.: Discovering representative episodal association rules from event sequences using frequent closed episode sets and event constraints. In: ICDM 2001, pp. 603–606 (2001)
Harms, S.K., Deogun, J., Tadesse, T.: Discovering Sequential Association Rules with Constraints and Time Lags in Multiple Sequences. In: ISMIS 2002, pp. 432–441 (2002)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)
Liu, Y., Choudhary, A., Zhou, J., Khokhar, A.: A Scalable Distributed Stream Mining System for Highway Traffic Data. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 309–321. Springer, Heidelberg (2006)
Manku, G.S., Motwani, R.: Approximate Frequency Counts Over Data Streams. In: VLDB 2002, pp. 346–357 (2002)
Laxman, S., Sastry, P.S., Unnikrishnan, K.P.: A Fast algorithm for Finding Frequent Episodes in Event Streams. In: KDD 2007, pp. 410–419 (2007)
Mannila, H., Toivonen, H.: Discovering Generalized Episodes using Minimal Occurrence. In: KDD 1996, pp. 146–151 (1996)
Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of Frequent Episodes in Event Sequences. Data Mining and Knowledge Discovery 1(3), 259–289 (1997)
Mannila, H., Verkamo, A.I., Toivonen, H.: Discovering Frequent Episodes in Sequences. In: KDD 1995, pp. 210–215 (1995)
Mielikäinen, T.: Discovery of Serial Episodes from Streams of Events. In: SSDBM 2004, p. 447 (2004)
Tadesse, T., Wilhite, D.A., Hayes, M.J.: Discovering Associations between Climatic and Oceanic Parameters to Monitor Drought in Nebraska Using Data-Mining Techniques. Journal of Climate 18(10), 1541–1550 (2005)
Multivariate ENSO Index (MEI), http://www.cdc.noaa.gov/people/klaus.wolter/MEI/
Pacific Decadal Oscillation (PDO) Index, http://jisao.washington.edu/data_sets/pdo/
Standardized Precipitation Index, http://www.drought.unl.edu/monitor/archivedspi.htm
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, TY., Wang, E.T., Chen, A.L.P. (2008). Mining Serial Episode Rules with Time Lags over Multiple Data Streams. In: Song, IY., Eder, J., Nguyen, T.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2008. Lecture Notes in Computer Science, vol 5182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85836-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-85836-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85835-5
Online ISBN: 978-3-540-85836-2
eBook Packages: Computer ScienceComputer Science (R0)