Abstract
Among the family of the local patterns, episodes are commonly used when mining a single or multiple sequences of discrete events. An episode reflects a qualitative relation is-followed-by over event types, and the refinement of episodes to incorporate quantitative temporal information is still an on going research, with many application opportunities. In this paper, focusing on serial episodes, we design such a refinement called quantitative episodes and give a corresponding extraction algorithm. The three most salient features of these quantitative episodes are: (1) their ability to characterize main groups of homogeneous behaviors among the occurrences, according to the duration of the is-followed-by steps, and providing quantitative bounds of these durations organized in a tree structure; (2) the possibility to extract them in a complete way; and (3) to perform such extractions at the cost of a limited overhead with respect to the extraction of standard episodes.
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.: Mining sequential patterns. In: Yu, P.S., Chen, A.S.P. (eds.) Proc. of the 11th International Conference on Data Engineering (ICDE 1995), Taipei, Taiwan, pp. 3–14. IEEE Computer Society Press, Los Alamitos (1995)
Das, G., Lin, K., Mannila, H., Renganathan, G., Padhraic Smyth, P.: Rule discovery from time series. In: Proc. of the 4th International Conference on Knowledge Discovery and Data Mining (KDD 1998), August 1998, pp. 16–22. AAAI Press, New York (USA) (1998)
Dousson, C., Duong, T.V.: Discovering chronicles with numerical time constraints from alarm logs for monitoring dynamic systems. In: Proc. of the 16th Int. Joint Conference on Artificial Intelligence (IJCAI 1999), San Francisco, CA, USA, pp. 620–626 (1999)
Giannotti, F., Nanni, M., Pedreschi, D.: Efficient mining of temporally annotated sequences. In: Jonker, W., Petković, M. (eds.) SDM 2006. LNCS, vol. 4165, Springer, Heidelberg (2006)
Hatonen, K., Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H.: TASA: Telecomunications alarm sequence analyzer or: How to enjoy faults in your network. In: 1996 IEEE Network Operations and Management Symposium (NOMS 1996), Kyoto, Japan, April 1996, pp. 520–529 (1996)
Hirate, Y., Yamana, H.: Sequential pattern mining with time intervals. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, Springer, Heidelberg (2006)
Mannila, H., Toivonen, H.: Discovery of generalized episodes using minimal occurrences. In: Proc. of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD 1996), August 1996, Portland, Oregon, pp. 146–151 (1996)
Mannila, H., Toivonen, H., Verkamo, A.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1(3), 259–298 (1997)
Mannila, H., Toivonen, H., Verkamo, I.: Discovering frequent episodes in sequences. In: Proc. of the 1st International Conference on Knowledge Discovery and Data Mining (KDD 1995), Montreal, Canada, August 1995, pp. 210–215. AAAI Press, Montreal (1995)
Meger, N., Leschi, C., Lucas, N., Rigotti, C.: Mining episode rules in STULONG dataset. In: Proc. of the ECML/PKDD Discovery Challenge, September 2004, Pisa, Italy (2004)
Meger, N., Rigotti, C.: Constraint-based mining of episode rules and optimal window sizes. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 313–324. Springer, Heidelberg (2004)
Vautier, A., Cordier, M.-O., Quiniou, R.: An inductive database for mining temporal patterns in event sequences. In: ECML/PKDD Workshop on Mining Spatial and Temporal Data (2005)
Yoshida, M., et al.: Mining sequential patterns including time intervals. In: Data Mining and Knowledge Discovery: Theory, Tools and Technology II. SPIE Conference (2000)
Zaki, M.: Spade: an efficient algorithm for mining frequent sequences. Machine Learning, Special issue on Unsupervised Learning 42(1/2), 31–60 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nanni, M., Rigotti, C. (2007). Extracting Trees of Quantitative Serial Episodes. In: Džeroski, S., Struyf, J. (eds) Knowledge Discovery in Inductive Databases. KDID 2006. Lecture Notes in Computer Science, vol 4747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75549-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-75549-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75548-7
Online ISBN: 978-3-540-75549-4
eBook Packages: Computer ScienceComputer Science (R0)