Anomaly Detection in Large Graphs
IEEE-Tencent Rhino Bird program, Shenzhen, China
June 13, 2017
Abstract
Given a large graph, like who-calls-whom,
or who-likes-whom,
what behavior is normal and what should be surprising,
possibly due to fraudulent activity?
How do graphs evolve over time?
We focus on these topics:
(a) anomaly detection in large static graphs
and
(b) patterns and anomalies in large time-evolving graphs.
For the first, we present a list of static and temporal laws,
including advances patterns like 'eigenspokes';
we show how to use them to spot suspicious activities,
in on-line buyer-and-seller settings, in FaceBook,
in twitter-like networks.
For the second, we show how to handle time-evolving graphs
as tensors, as well as some surprising discoveries such settings.
Foils
Foils in
pdf.
Last updated by: Christos Faloutsos, June 9, 2017.