Abstract
Researchers have been endeavoring to discover concise sets of episode rules instead of complete sets in sequences. Existing approaches, however, are not able to process complex sequences and can not guarantee the accuracy of resulting sets due to the violation of anti-monotonicity of the frequency metric. In some real applications, episode rules need to be extracted from complex sequences in which multiple items may appear in a time slot. This paper investigates the discovery of concise episode rules in complex sequences. We define a concise representation called non-derivable episode rules and formularize the mining problem. Adopting a novel anti-monotonic frequency metric, we then develop a fast approach to discover non-derivable episode rules in complex sequences. Experimental results demonstrate that the utility of the proposed approach substantially reduces the number of rules and achieves fast processing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: ACM-SIGMOD International Conference on Management of Data, Washington, USA, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: 20th International Conference on Very Large Data Bases, pp. 487–499 (1994)
Gan, M., Dai, H.: A Study on the Accuracy of Frequency Measures and its Impact on Knowledge Discovery in Single Sequences. In: Workshops at IEEE 10th Int. Conf. on Data Mining, Sydney, Australia, pp. 859–866 (2010)
Gan, M., Dai, H.: Obtaining Accurate Frequencies of Sequential Patterns over a Single Sequence. ICIC Express Letters 5(4) (2011) (in press)
Harms, S.K., Saquer, J., Tadesse, T.: Discovering Representative Episodal Association Rules from Event Sequences Using Frequent Closed Episode Sets and Event Constraints. In: IEEE International Conference on Data Mining (2001)
Huang, K., Chang, C.: Efficient Mining of Frequent Episodes from Complex Sequences. Information Systems 33(1), 96–114 (2008)
Iwanuma, K., Ishihara, R., Takano, Y., Nabeshima, H.: Extracting Frequent Subsequences from a Single Long Data Sequence: a Novel Anti-monotonic Measure and a Simple On-line Algorithm. In: 3rd IEEE International Conference on Data Mining, Texas, USA, pp. 186–193 (2005)
Laxman, S., Sastry, P., Unnikrishnan, K.: A Fast Algorithm for Finding Frequent Episodes in Event Streams. In: 13th International Conference on Knowledge Discovery and Data Mining, California, USA, pp. 410–419 (2007)
Mannila, H., Toivonen, H., Verkamo, A.: Discovering Frequent Episodes in Sequences. In: 1st International Conference on Knowledge Discovery and Data Mining, Montreal, Canada, pp. 210–215 (1995)
Mannila, H., Toivonen, H.: Discovering Generalized Episodes Using Minimal Occurrences. In: 2nd International Conference on Knowledge Discovery and Data Mining, Oregon, USA, 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)
Pei, J., Liu, J., Wang, H., Wang, K., Yu, P., Wang, J.: Efficiently Mining Frequent Closed Partial Orders. In: 5th IEEE International Conference on Data Mining, pp. 753–756 (2005)
Tzvetkov, P., Yan, X., Han, J.: TSP: Mining Ttop-k Closed Sequential Patterns. Knowl. Inf. Syst. 7(4), 438–457 (2005)
Wang, J., Han, J.: BIDE: Efficient Mining of Frequent Closed Sequences. In: 20th International Conference on Data Engineering, Boston, MA, USA, pp. 79–90 (2004)
Wang, J., Han, J., Li, C.: Frequent Closed Sequence Mining without Candidate Maintenance. IEEE Trans. Knowl. Data Eng. 19(8), 1042–1056 (2007)
Yan, X., Han, J., Afshar, R.: CloSpan: Mining Closed Sequential Patterns in Large Databases. In: SIAM International Conference on Data Mining (2003)
Zhou, W., Liu, H., Cheng, H.: Mining Closed Episodes from Event Sequences Efficiently. In: 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Hyderabad, India, pp. 310–318 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gan, M., Dai, H. (2011). Fast Mining of Non-derivable Episode Rules in Complex Sequences. In: Torra, V., Narakawa, Y., Yin, J., Long, J. (eds) Modeling Decision for Artificial Intelligence. MDAI 2011. Lecture Notes in Computer Science(), vol 6820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22589-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-22589-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22588-8
Online ISBN: 978-3-642-22589-5
eBook Packages: Computer ScienceComputer Science (R0)