Posted: March 19, 2016 ┃ Category: Awards, In-the-News

Our alumnus, Jure Leskovec (PhD SCS/MLD, now at Stanford), won the prestigious Lagrange Prize. Established in 2008 by the CRT Foundation and coordinated by the ISI Foundation, the Lagrange Prize is part of the Lagrange Project, one of the most innovative European initiatives  dedicated entirely to studying complex systems and data science, where a culture of innovation is  encouraged through PHD scholarships and research grants. The Prize is the symbolic event of the Lagrange Project: a prestigious international acknowledgement – Our alumnus, Jure Leskovec (PhD SCS/MLD, now at Stanford), won the prestigious Lagrange Prize. Established in 2008 by the CRT Foundation and coordinated by the ISI Foundation, the Lagrange Prize is part of the Lagrange Project, one of the most Read More

Posted: May 24, 2014 ┃ Category: In-the-News

Danai and the Microsoft researchers Paul Bennett and Eric Horvitz studied information-seeking behavior and access to alternative versus reinforcing viewpoints for strongly polarizing topics. In particular, they analyzed the search and browsing behavior on the gun control debate following a shocking news event, the Sandy Hook Elementary School shootings in Newtown, Connecticut. The paper is at: http://arxiv.org/pdf/1405.1486v1.pdf The MIT Tech Review article is at: http://www.technologyreview.com/view/527311/sandy-hook-the-gun-control-debate-and-the-insidious-influence-of-the-filter-bubble/ Other press coverage includes: http://www.technology.org/2014/05/13/ideological-internet-bubbles-stay-strong-study-shows/# Danai and the Microsoft researchers Paul Bennett and Eric Horvitz studied information-seeking behavior and access to alternative versus reinforcing viewpoints for strongly polarizing topics. In particular, they analyzed the search and browsing behavior on the gun control debate following a Read More

Posted: December 18, 2013 ┃ Category: In-the-News

Prof. Hanghang TONG (MLD phd) and Prof. Leman Akoglu (CSD phd) worked on analyzing the correlation between quality of questions and quality of answers, in "stack-overflow" - their paper is on the web: http://arxiv.org/abs/1311.6876 The MIT-tech-review article can be found at http://www.technologyreview.com/view/522171/data-mining-reveals-the-secret-to-getting-good-answers/ Congratulations, Hanghang and Leman! Prof. Hanghang TONG (MLD phd) and Prof. Leman Akoglu (CSD phd) worked on analyzing the correlation between quality of questions and quality of answers, in "stack-overflow" - their paper is on the web: http://arxiv.org/abs/1311.6876 The MIT-tech-review article can be found Read More

Posted: May 22, 2011 ┃ Category: In-the-News

Polo speaks out on graph mining and fraud detection. Polo Chau has an invited article in ACM Crossroads, explaining how his work can help spot fraudsters Congratulations Polo! Polo speaks out on graph mining and fraud detection. Polo Chau has an invited article in ACM Crossroads, explaining how his work can help spot fraudsters Congratulations Polo! Read More

Posted: September 30, 2008 ┃ Category: In-the-News

SCS PhD candidate Jure Leskovec, and his MSR colleagues, studied the largest social network in published literature, the Microsoft Instant Messenger network, and found 6.6 degrees of separation, among other fascinating results. The work is mentioned in major news venues, including Washington Post, MSNBC, BBC news, Guardian, Spiegel. The work showed that, even in a huge network of millions of people, we still have the ``six degrees of separation' phenomenon, that Milgram observed decades ago, in a social network of SCS PhD candidate Jure Leskovec, and his MSR colleagues, studied the largest social network in published literature, the Microsoft Instant Messenger network, and found 6.6 degrees of separation, among other fascinating results. The work is mentioned in major news venues, Read More