Senior Staff Research Scientis
Algorithmic Challenges in Large-scale Graph Mining
Computer Engineering Department, Floor 4, Kharazmi Hall
Thursday, 31 December 2015
11:15 - 12:15
In this talk, I discuss large-scale graph mining. The goal of the talk is to develop present new results and models for distributed graph mining. I present an overview of challenges from various perspectives: application-inspired algorithmic problems, and distributed computation challenges. In the first topic, I discuss the model of public-private graphs and the use of ego-net clustering in recommender systems. On the 2nd topic, I discuss randomized composable core-sets for and clustering and distributed submodular maximization. Finally, I discuss hybrid algorithmic problems for computing connected components in a distributed manner.
Vahab Mirrokni is a Senior Staff Research Scientist, heading the algorithms research group at Google Research, New York. He received his PhD from MIT in 2005 and his B.Sc. from Sharif University of Technology in 1999. He joined Google Research in New York in 2008, after spending a couple of years at Microsoft Research, MIT and Amazon.com. He is the co-winner of a SODA05 best student paper award and ACM EC08 best paper award. His research areas include algorithms, algorithmic game theory, combinatorial optimization, and social networks analysis. At Google, he is mainly working on algorithmic and economic problems related to search and online advertising. Recently he is working on online ad allocation problems, distributed algorithms for large-scale graph mining, and mechanism design for advertising exchanges.