Discovering Structural Anomalies in Graph-Based Data
Authors:
- William EberleWEWilliam Eberle
- Lawrence HolderLHLawrence Holder
- 1 October 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23759232,p. 393-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
This publication has 8 references indexed in Scilit:
- Relevance search and anomaly detection in bipartite graphsACM SIGKDD Explorations Newsletter, 2005
- The case for anomalous link discoveryACM SIGKDD Explorations Newsletter, 2005
- Discovering important nodes through graph entropy the case of Enron email database2005
- AutoPart: Parameter-Free Graph Partitioning and Outlier Detection2004
- Graph-based anomaly detection2003
- Graph-based data miningIEEE Intelligent Systems and their Applications, 2000
- Fast spinning into oblivion? Recent developments in money-laundering policies and offshore finance centresThird World Quarterly, 1999
- Substructure Discovery Using Minimum Description Length and Background KnowledgeJournal of Artificial Intelligence Research, 1994