Computer scientist predicts your next Facebook friends

10.08.2011

"The interesting question is how to find the right connections, for example, when you want to know who to ask to get introduced to the queen of England," said Leskovec. A solution to this question could help in finding efficient ways for routing through the Web, he adds. This could, for instance, be useful for finding the shortest path between two computers on the Internet.

Apart from social networks, Leskovec analyzes the use of online media as well, and he lets his computers dig through 30 million articles every day. One of his goals is to design algorithms to find patterns that show what happens to these news items. This could show, for example, how information changes gradually. "It could reveal that your political attitude affects how you treat certain information. Maybe you forward a very long Obama statement while you shorten the quotes of other people in a text," Leskovec said.

Recently he found out in a study that news spreads quite differently depending on the platform where it is first published. One finding was that material published by newswires gained the highest attention shortly after being published. Blog posts in contrast very often got a number of attention peaks over time.

Leskovec has already made some plans on how to spend the money coming with the fellowship (he will receive US$100,000 this year and the same amount in 2012). Leskovec said part of the money will go into "risky projects or startups" that without the grant would not have been possible to do. He said he particularly appreciates the fact that he can use the money at his own discretion. "It is a gift without strings attached and we did not promise anything in return," he said.

Leskovec also plans to buy new equipment and use part of the grant to organize seminars. He wants to send his students to work with Microsoft, too. "That is a good opportunity for them to get introduced into new fields of research," he said.