Abstract
Today, event logs contain vast amounts of data that can easily overwhelm a human. Therefore, the mining of frequent patterns from event logs is an important system and network management task. This paper discusses the properties of event log data, analyses the suitability of popular mining algorithms for processing event log data, and proposes an efficient algorithm for mining frequent patterns from event logs.
This work is supported by the Union Bank of Estonia and partly sponsored by the Estonian Science Foundation under the grant 5766.
Chapter PDF
Similar content being viewed by others
References
Lonvick, C.: The BSD syslog Protocol. RFC3164 (2001)
Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1(3), 259–289 (1997)
Zheng, Q., Xu, K., Lv, W., Ma, S.: Intelligent Search of Correlated Alarms from Database Containing Noise Data. In: Proceedings of the 8th IEEE/IFIP Network Operations and Management Symposium, pp. 405–419 (2002)
Ma, S., Hellerstein, J.L.: Mining Partially Periodic Event Patterns with Unknown Periods. In: Proceedings of the 16th International Conference on Data Engineering, pp. 205–214 (2000)
Pei, J., Han, J., Mortazavi-asl, B., Zhu, H.: Mining Access Patterns Efficiently from Web Logs. In: Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 396–407 (2000)
Srivastava, J., Cooley, R., Deshpande, M., Tan, P.-N.: Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data. ACM SIGKDD Explorations 1(2), 12–23 (2000)
Klemettinen, M.: A Knowledge Discovery Methodology for Telecommunication Network Alarm Databases. PhD thesis, University of Helsinki (1999)
Vaarandi, R.: A Data Clustering Algorithm for Mining Patterns From Event Logs. In: Proceedings of the 2003 IEEE Workshop on IP Operations and Management, pp. 119–126 (2003)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 478–499 (1994)
Bodon, F.: A fast APRIORI implementation. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)
Borgelt, C.: Efficient Implementations of Apriori and Eclat. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)
Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering 12(3), 372–390 (2000)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp. 1–12 (2000)
Goethals, B.: Memory issues in frequent itemset mining. In: Proceedings of the 2004 ACM Symposium on Applied Computing, pp. 530–534 (2004)
Ramakrishna, M.V., Zobel, J.: Performance in Practice of String Hashing Functions. In: Proceedings of the 5th International Conference on Database Systems for Advanced Applications, pp. 215–224 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vaarandi, R. (2004). A Breadth-First Algorithm for Mining Frequent Patterns from Event Logs. In: Aagesen, F.A., Anutariya, C., Wuwongse, V. (eds) Intelligence in Communication Systems. INTELLCOMM 2004. Lecture Notes in Computer Science, vol 3283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30179-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-30179-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23893-5
Online ISBN: 978-3-540-30179-0
eBook Packages: Springer Book Archive