skip to main content
10.1145/1852666.1852703acmotherconferencesArticle/Chapter ViewAbstractPublication PagescsiirwConference Proceedingsconference-collections
research-article

A reference based analysis framework for analyzing system call traces

Published:21 April 2010Publication History

ABSTRACT

Reference based analysis (RBA) is a novel data mining tool for exploring a test data set with respect to a reference data set. The power of RBA lies in it ability to transform any complex data type, such as symbolic sequences and multi-variate categorical data instances, into a multivariate continuous representation. The transformed representation not only allows visualization of the complex data, which cannot be otherwise visualized in its original form, but also allows enhanced anomaly detection in the transformed feature space. We demonstrate the application of the RBA framework in analyzing system call traces and show how the transformation results in improved intrusion detection performance over state of art data mining based intrusion detection methods developed for system call traces.

Skip Supplemental Material Section

Supplemental Material

References

  1. V. Chandola. Anomaly Detection for Symbolic Sequences and Time Series Data. PhD thesis, University of Minnesota, Sept. 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. V. Chandola, S. Boriah, and V. Kumar. A framework for exploring categorical data. In Proceedings of the ninth SIAM International Conference on Data Mining, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  3. V. Chandola, V. Mithal, and V. Kumar. A comparative evaluation of anomaly detection techniques for sequence data. In Proceedings of International Conference on Data Mining, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Forrest, C. Warrender, and B. Pearlmutter. Detecting intrusions using system calls: Alternate data models. In Proceedings of the 1999 IEEE ISRSP, pages 133--145, Washington, DC, USA, 1999. IEEE Computer Society.Google ScholarGoogle Scholar
  5. B. Gao, H.-Y. Ma, and Y.-H. Yang. Hmms (hidden markov models) based on anomaly intrusion detection method. In Proceedings of International Conference on Machine Learning and Cybernetics, pages 381--385. IEEE, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  6. F. A. Gonzalez and D. Dasgupta. Anomaly detection using real-valued negative selection. Genetic Programming and Evolvable Machines, 4(4):383--403, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. A. Hofmeyr, S. Forrest, and A. Somayaji. Intrusion detection using sequences of system calls. Journal of Computer Security, 6(3):151--180, 1998. Google ScholarGoogle ScholarCross RefCross Ref
  8. T. Lane and C. E. Brodley. Temporal sequence learning and data reduction for anomaly detection. ACM Transactions on Information Systems and Security, 2(3):295--331, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. W. Lee and S. Stolfo. Data mining approaches for intrusion detection. In Proceedings of the 7th USENIX Security Symposium, San Antonio, TX, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. W. Lee, S. Stolfo, and P. Chan. Learning patterns from unix process execution traces for intrusion detection. In Proceedings of the AAAI 97 workshop on AI methods in Fraud and risk management, 1997.Google ScholarGoogle Scholar
  11. R. P. Lippmann and et al. Evaluating intrusion detection systems - the 1998 darpa off-line intrusion detection evaluation. In DARPA Information Survivability Conference and Exposition (DISCEX) 2000, volume 2, pages 12--26. IEEE Computer Society Press, 2000.Google ScholarGoogle Scholar
  12. C. C. Michael and A. Ghosh. Two state-based approaches to program-based anomaly detection. In Proceedings of the 16th Annual Computer Security Applications Conference, page 21. IEEE Computer Society, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. N. Nguyen and P. Reiher. Detecting insider threats by monitoring system call activity. In IEEE Information Assurance Workshop, pages 18--20, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  14. S. Ramaswamy, R. Rastogi, and K. Shim. Efficient algorithms for mining outliers from large data sets. In Proceedings of the ACM SIGMOD international conference on Management of data, pages 427--438. ACM, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A reference based analysis framework for analyzing system call traces

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      CSIIRW '10: Proceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research
      April 2010
      257 pages
      ISBN:9781450300179
      DOI:10.1145/1852666

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 21 April 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader