Abstract
Events are used to monitor many types of processes in several technical domains. Computers and efficient electronic communication networks make it very easy to increase the accuracy and amount of logged details. While the size of logs is growing, the collection and analysis of them are becoming harder all the time. Frequent episodes offer one possible method to structure and find information hidden in logs. Unfortunately, as events reflecting simultaneous independent processes are stored to central monitoring points, signs of several unrelated phenomena get mixed with each other. This makes the algorithm searching for frequent episodes to produce accidental and irrelevant results. As a solution to this problem, we introduce here a notion of domain constraints that are based on distance measures, which can be defined in terms of domain structure and used taxonomies. We also show how these constraints can be used to prune irrelevant event combinations.
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: Buneman, P., Jajodia, S. (eds.) Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD 1993), May 1993, pp. 207–216. ACM, Washington, D.C. (1993)
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press, Menlo Park (1996)
Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P.: From data mining to knowledge discovery: An overview. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 1–34. AAAI Press, Menlo Park (1996)
Garofalakis, M.N., Rastogi, R., Shim, K.: SPIRIT: Sequential pattern mining with regular expression constraints. In: Proc. of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland, pp. 223–234 (1999)
Hätönen, K., Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H.: TASA: Telecommunication alarm sequence analyzer, or “How to enjoy faults in your network”. In: Proceedings of the 1996 IEEE Network Operations and Management Symposium (NOMS 1996), Kyoto, Japan, April 1996, pp. 520–529. IEEE, Los Alamitos (1996)
Jakobson, G., Weissman, M.: Real-time telecommunication network management: Extending event correlation with temporal constraints. In: Integrated Network Management IV, pp. 290–301. Chapman & Hall, London (1995)
Jakobson, G., Weissman, M.D.: Alarm correlation. IEEE Network 7(6), 52–59 (1993)
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.I.: Finding interesting rules from large sets of discovered association rules. In: Proceedings of the Third International Conference on Information and Knowledge Management (CIKM 1994), Gaithersburg, MD, November 1994, pp. 401–407. ACM, New York (1994)
Mannila, H., Toivonen, H.: Discovering generalized episodes using minimal occurrences. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996), Portland, Oregon, August 1996, pp. 146–151. AAAI Press, Menlo Park (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)
Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proc. of the 1998 ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, pp. 13–24 (1998)
Zaki, M.J.: Sequence mining in categorical domains: Incorporating constraints. In: Proc. of the 2000 ACM CIKM International Conference on Information and Knowledge Management, McLean, VA, USA, pp. 422–429 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hätönen, K., Klemettinen, M. (2004). Domain Structures in Filtering Irrelevant Frequent Patterns. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds) Database Support for Data Mining Applications. Lecture Notes in Computer Science(), vol 2682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44497-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-44497-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22479-2
Online ISBN: 978-3-540-44497-8
eBook Packages: Springer Book Archive