• DocumentCode
    3189930
  • Title

    Discovering Structural Anomalies in Graph-Based Data

  • Author

    Eberle, William ; Holder, Lawrence

  • fYear
    2007
  • fDate
    28-31 Oct. 2007
  • Firstpage
    393
  • Lastpage
    398
  • Abstract
    The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly detection, particularly for fraud, but less work has been done in terms of detecting anomalies in graph-based data. While there has been some work that has used statistical metrics and conditional entropy measurements, the results have been limited to certain types of anomalies and specific domains. In this paper we present graph- based approaches to uncovering anomalies in domains where the anomalies consist of unexpected entity/relationship deviations that resemble non- anomalous behavior. Using synthetic and real-world data, we evaluate the effectiveness of these algorithms at discovering anomalies in a graph-based representation of data.
  • Keywords
    Algorithm design and analysis; Bipartite graph; Conferences; Credit cards; Data analysis; Data mining; Entropy; Information analysis; Needles; Sun;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Mining Workshops, 2007. ICDM Workshops 2007. Seventh IEEE International Conference on
  • Conference_Location
    Omaha, NE, USA
  • Print_ISBN
    978-0-7695-3019-2
  • Electronic_ISBN
    978-0-7695-3033-8
  • Type

    conf

  • DOI
    10.1109/ICDMW.2007.91
  • Filename
    4476697