Detecting Motifs in System Call Sequences

Unknown, Conference object, Preprint English OPEN
Wilson, William ; Feyereisl, J ; Aickelin, Uwe (2007)
  • Subject: Computer Science - Artificial Intelligence | Computer Science - Neural and Evolutionary Computing | Computer Science - Cryptography and Security

The search for patterns or motifs in data represents an area of key interest to many researchers. In this paper we present the Motif Tracking Algorithm, a novel immune inspired pattern identification tool that is able to identify unknown motifs which repeat within time series data. The power of the algorithm is derived from its use of a small number of parameters with minimal assumptions. The algorithm searches from a completely neutral perspective that is independent of the data being analysed, and the underlying motifs. In this paper the motif tracking algorithm is applied to the search for patterns within sequences of low level system calls between the Linux kernel and the operating system's user space. The MTA is able to compress data found in large system call data sets to a limited number of motifs which summarise that data. The motifs provide a resource from which a profile of executed processes can be built. The potential for these profiles and new implications for security research are highlighted. A higher level call system language for measuring similarity between patterns of such calls is also suggested.
  • References (15)
    15 references, page 1 of 2

    1. Nunn, I., White, T.: The application of antigenic search techniques to time series forecasting. GECCO (June 2005) 353-360

    2. Wilson, W.O., Birkin, P., Aickelin, U.: Motif detection inspired by immune memory. In: Proceedings of the 6th International Conference on Artificial Immune Systems (ICARIS 2007). Lecture Notes in Computer Science, Santos, Brazil (2007)

    3. de Castro, L.N., Von Zuben, F.J.: Learning and optimization using the clonal selection principle. IEEE Transactions on Evolutionary Computation 6(3) (2002) 239-251

    4. Lin, J., Keogh, E., Lonardi, S., Patel, P.: Finding motifs in time series. In the 2nd workshop on temporal data mining, at the 8th ACM SIGKDD international conference on knowledge discovery and data mining (July, 2002)

    5. Guan, X., Uberbacher, E.C.: A fast look up algorithm for detecting repetitive dna sequences. Pacific symposium on biocomputing, Hawaii IEEE Tran. Control Systems Tech. (December 1996)

    6. Keogh, E., Smyth, P.: A probabilistic approach to fast pattern matching in time series databases. In proceedings of the third international conference of knowledge discovery and data mining (1997) 20-24

    7. Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time series databases. In proceedings of the SIGMOD conference (1994) 419-429

    8. Chiu, B., Keogh, E., Lonardi, S.: Probabilistic discovery of time series motifs. SIGKDD (August, 2003)

    9. Lin, J., Keogh, E., Lonardi, S.: Visualizing and discovering non trivial patterns in large time series databases. Information visualization 4, issue 2 (2005) 61-82

    10. Tanaka, Y., Uehara, K.: Discover motifs in multi-dimensional time series using the principal component analysis and the mdl principle. 3rd international conference on machine learning and data mining in pattern recognition Leipzig, Germany (2003) 252-265

  • Metrics
    No metrics available
Share - Bookmark