Carnegie Mellon University
June 06, 2017

Christos Faloutsos Gives Keynote Speech at WWW 2014 in Seoul, Korea

Professor Christos FaloutsosProfessor Christos Faloutsos


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? How does influence/news/viruses propagate, over time? We focus on three topics: (a) anomaly detection in large static graphs (b) patterns and anomalies in large time-evolving graphs and (c) cascades and immunization.

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, how to handle large tensors in map-reduce environments, as well as some discoveries such settings.

For the third, we show that for virus propagation, a single number is enough to characterize the connectivity of graph, and thus we show how to do efficient immunization for almost any type of virus (SIS – no immunity; SIR – lifetime immunity; etc)
We conclude with some open research questions for graph mining.

The WWW conference series is the premier conference on research and development on Web technologies and the Web "ecosystem". It has a long tradition of reporting ground-breaking results, e.g., the page rank paper was published by Brin and Page in WWW 1998 in Brisbane, among many others. It features a wide range of keynotes such as Tim Berners-Lee, A. P. J. Abdul Kalam (former president of India, the "People's President"), Christos H. Papadimitriou,  Vint Cerf, and Carl Malamud, among other well known names.

Faculty 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), nineteen “best paper” awards (including two “test of time” awards), and four teaching awards. He is an ACM Fellow, he has served as a member of the executive committee of SIGKDD; he has published over 200 refereed articles, 11 book chapters and one monograph. He holds six patents and he has given over 30 tutorials and over 10 invited distinguished lectures.

His research interests include data mining for graphs and streams, fractals, database performance, and indexing for multimedia and bio-informatics data.