CSE Distinguished Lecture
Mining Large Graphs: Patterns, Anomalies and Fraud Detection
The second speaker in the Fall 2016 CSE Distinguished Lecture Series is Prof. Christos Faloutsos, a Professor of Computer Science and Electrical and Computer Engineering at Carnegie Mellon University. He will discuss “Mining Large Graphs: Patterns, Anomalies and Fraud Detection.”
Date: Monday, October 10
Time: 11:00am – Noon
Location: Room 1202, CSE Building
Host: CSE Prof. Julian McAuley
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, 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 discoveries such settings.
Bio: Christos Faloutsos is a Professor at Carnegie Mellon University. He has received the Presidential Young Investigator Award by the National Science Foundation (1989), the Research Contributions Award in ICDM 2006, the SIGKDD Innovations Award (2010), 24 best-paper awards (including 5 ‘test of time’ awards), and four teaching awards.
Six of his advisees have attracted KDD or SCS dissertation awards. Faloutsos is an ACM Fellow, he has served as a member of the executive committee of SIGKDD; he has published over 350 refereed articles, 17 book chapters and two monographs. He holds seven patents (and two pending) and he has given over 40 tutorials and over 20 invited distinguished lectures. His research interests include large-scale data mining, for graphs and streams; networks, fractals, and multimedia databases.