Oddball: Spotting Anomalies in Weighted Graphs

Oddball: Spotting Anomalies in Weighted Graphs,10.1007/978-3-642-13672-6_40,Leman Akoglu,Mary McGlohon,Christos Faloutsos

Oddball: Spotting Anomalies in Weighted Graphs   (Citations: 8)
BibTex | RIS | RefWorks Download
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the oddball algorithm, to find such nodes. The contributions are the following: (a) we discover several new rules (power laws) in density, weights, ranks and eigenvalues that seem to govern the so-called “neighborhood sub-graphs” and we show how to use these rules for anomaly detection; (b) we carefully choose features, and design oddball, so that it is scalable and it can work un-supervised (no user-defined constants) and (c) we report experiments on many real graphs with up to 1.6 million nodes, where oddball indeed spots unusual nodes that agree with intuition.
Published in 2010.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: