Frequent pattern mining for kernel trace data
Authors:
Open Access
- 16 March 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 880-885
Abstract
Operating systems engineers have developed tracing tools that log details about process execution at the kernel level. These tools make it easier to understand the actual execution that takes place on real systems. Unfortunately, uncovering certain types of useful information in kernel trace data is nearly impossible through manual inspection of a trace log. To detect interesting interprocess communication patterns and other recurring runtime execution patterns in operating system trace logs, we employ data mining techniques, in particular, frequent pattern mining. We present a framework for mining kernel trace data, making use of frequent pattern mining in conjunction with special considerations for the temporal characteristics of kernel trace data. We report our findings using our framework to isolate processes responsible for systemic problems on a LINUX system and demonstrate our framework is versatile and efficient.Keywords
This publication has 8 references indexed in Scilit:
- Stardust2006
- Finding Maximal Frequent Itemsets over Online Data Streams Adaptively2006
- MAFIA: a maximal frequent itemset algorithmIEEE Transactions on Knowledge and Data Engineering, 2005
- Learning to detect malicious executables in the wild2004
- Adaptive Intrusion Detection: A Data Mining ApproachArtificial Intelligence Review, 2000
- Temporal sequence learning and data reduction for anomaly detection1998
- Discovery of Frequent Episodes in Event SequencesData Mining and Knowledge Discovery, 1997
- A study of integrated prefetching and caching strategies1995