Mining large social networks
Event details
| Date | 08.06.2010 |
| Hour | 14:15 |
| Speaker | Prof. Vincent Blondel, Université Catholique de Louvain and MIT |
| Location | |
| Category | Conferences - Seminars |
I will describe recent methods that allows the efficient extraction of information in very large networks. I will first show how a simple generalization of PageRank can be used to compute similarities between graph vertices. I will then describe an algorithm for detecting communities in very large networks and will show the surprising results obtained with this algorithm on a country-wide mobile phone database of more than one billion phone calls. Prof. Blondel's homepage
Practical information
- General public
- Free