A breadth-first algorithm for mining frequent patterns from event logs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3283, Issue , 2004, Pages 293-308

  Vaarandi, Risto ^a  

^a TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING;

BREADTH-FIRST ALGORITHMS; EVENT LOGS; LOG DATA; MINING ALGORITHMS;

DATA MINING;

EID: 35048859299     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30179-0_27     Document Type: Article

References (16)

1. C. Lonvick: The BSD syslog Protocol. RFC3164 (2001)
2. H. Mannila, H. Toivonen, and A. I. Verkamo: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1(3) (1997) 259-289
3. Qingguo Zheng, Ke Xu, Weifeng Lv, and Shilong Ma: Intelligent Search of Correlated Alarms from Database Containing Noise Data. Proceedings of the 8th IEEE/IFIP Network Operations and Management Symposium (2002) 405-419
4. Sheng Ma and Joseph L. Hellerstein: Mining Partially Periodic Event Patterns with Unknown Periods. Proceedings of the 16th International Conference on Data Engineering (2000) 205-214
5. Jian Pei, Jiawei Han, Behzad Mortazavi-asl, and Hua Zhu: Mining Access Patterns Efficiently from Web Logs. Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining (2000) 396-407
6. Jaideep Srivastava, Robert Cooley, Mukund Deshpande, and Pang-Ning Tan: Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data. ACM SIGKDD Explorations 1(2) (2000) 12-23
7. Mika Klemettinen: A Knowledge Discovery Methodology for Telecommunication Network Alarm Databases. PhD thesis, University of Helsinki (1999)
8. Risto Vaarandi: A Data Clustering Algorithm for Mining Patterns From Event Logs. Proceedings of the 2003 IEEE Workshop on IP Operations and Management (2003) 119-126
9. Rakesh Agrawal and Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules. Proceedings of the 20th International Conference on Very Large Data Bases (1994) 478-499
10. Ferenc Bodon: A fast APRIORI implementation. Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)
11. Christian Borgelt: Efficient Implementations of Apriori and Eclat. Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)
12. Mohammed J. Zaki: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering 12(3) (2000) 372-390
13. Jiawei Han, Jian Pei, and Yiwen Yin: Mining Frequent Patterns without Candidate Generation. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (2000) 1-12
14. Bart Gocthals: Memory issues in frequent itemset mining. Proceedings of the 2004 ACM Symposium on Applied Computing (2004) 530-534
15. http://www.cs.helsinki.fi/u/goethals/software/index.html
16. M. V. Ramakrishna and Justin Zobel: Performance in Practice of String Hashing Functions. Proceedings of the 5th International Conference on Database Systems for Advanced Applications (1997) 215-224