skip to main content
10.1145/956750.956831acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
Article

Graph-based anomaly detection

Published:24 August 2003Publication History

ABSTRACT

Anomaly detection is an area that has received much attention in recent years. It has a wide variety of applications, including fraud detection and network intrusion detection. A good deal of research has been performed in this area, often using strings or attribute-value data as the medium from which anomalies are to be extracted. Little work, however, has focused on anomaly detection in graph-based data. In this paper, we introduce two techniques for graph-based anomaly detection. In addition, we introduce a new method for calculating the regularity of a graph, with applications to anomaly detection. We hypothesize that these methods will prove useful both for finding anomalies, and for determining the likelihood of successful anomaly detection within graph-based data. We provide experimental results using both real-world network intrusion data and artificially-created data.

References

  1. Cook, D. J. and Holder, L. B. Graph-Based Data Mining. IEEE Intelligent Systems, 15(2), pages 32--41, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Lee, W. and Xiang, D. Information-Theoretic Measures for Anomaly Detection. Proceedings of The 2001 IEEE Symposium on Security and Privacy, Oakland, CA, May 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Maxion, R. A. and Tan, K. M. C. Benchmarking Anomaly-Based Detection Systems. International Conference on Dependable Systems and Networks, pages 623--630, New York, New York; 25--28 June 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Miller, G. A. Note on the Bias of Information Estimates. Information Theory in Psychology: Problems and Methods, Free Press, 1955.Google ScholarGoogle Scholar
  5. Rissanen, J. Stochastic Complexity in Statistical Inquiry. World Scientific Publishing Company, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.htmlGoogle ScholarGoogle Scholar

Index Terms

  1. Graph-based anomaly detection

    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 Conferences
      KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
      August 2003
      736 pages
      ISBN:1581137370
      DOI:10.1145/956750

      Copyright © 2003 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: 24 August 2003

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      KDD '03 Paper Acceptance Rate46of298submissions,15%Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader