Posted: May 7, 2015 ┃ Category: Awards

SCS and database group alumna Prof. Leman Akoglu wins prestigious 'best paper' award! Leman is an assistant professor at Stonybrook (phd CMU '12), and she attracted the award at SDM, one of the flagship data mining conferences. The full citation is Where Graph Topology Matters: The Robust Subgraph Problem Hau Chan, Shuchu Han, and Leman Akoglu. SIAM SDM, Vancouver, BC, Canada, April 2015. The contributions are fast, practical algorithms to find well-connected sub-graphs, within a large, real graph, as well SCS and database group alumna Prof. Leman Akoglu wins prestigious 'best paper' award! Leman is an assistant professor at Stonybrook (phd CMU '12), and she attracted the award at SDM, one of the flagship data mining conferences. The full citation Read More

Posted: July 29, 2014 ┃ Category: Awards

Danai is invited to the 2014 Rising Stars in EECS: An Academic Career Workshop for Women, which will be hosted by UC Berkeley's EECS Department on November 3rd and 4th, 2014. This workshop will bring together approximately 40 outstanding EECS graduate and postdoctoral women, for two days of scientific/technical information exchange and career-oriented discussions on topics including the pros/cons of academia, finding a faculty position, and keys to success as a junior faculty member. Danai will have the opportunity to Danai is invited to the 2014 Rising Stars in EECS: An Academic Career Workshop for Women, which will be hosted by UC Berkeley's EECS Department on November 3rd and 4th, 2014. This workshop will bring together approximately 40 outstanding EECS Read More

Posted: July 29, 2014 ┃ Category: Awards

The paper CatchSync : Catching Synchronized Behavior in Large Directed Graphs, by Meng Jiang, Peng Cui, Alex Beutel, Christos Faloutsos and Shiqiang Yang, was selected for fast-track publication, as one of the 9 best papers that will appear in KDD'14. The paper describes a novel, automatic method to spot lock-step behavior in large social networks. Lockstep behavior is usually a sign of fraud. Meng was a post-doc visitor at CMU, working on anomaly detection in large graphs. Congratulations, Alex and The paper CatchSync : Catching Synchronized Behavior in Large Directed Graphs, by Meng Jiang, Peng Cui, Alex Beutel, Christos Faloutsos and Shiqiang Yang, was selected for fast-track publication, as one of the 9 best papers that will appear in KDD'14. Read More

Posted: May 10, 2014 ┃ Category: Awards

The Forum brings together winners of the Turing Award and Nevanlinna Prize (CS), as well as the Abel Prize and Fields Medal (math) for a week in Heidelberg. An international committee of experts selected 100 successful CS candidates from more than 40 countries around the world. Congratulations, Danai! The Forum brings together winners of the Turing Award and Nevanlinna Prize (CS), as well as the Abel Prize and Fields Medal (math) for a week in Heidelberg. An international committee of experts selected 100 successful CS candidates from more Read More

Posted: April 30, 2014 ┃ Category: Awards

SCS team and BBN and ARL collaborators win 'best student paper runner up' award, at PAKDD'14. The citation is: The paper describes a novel algorithm to spot time-evolving communities in large datasets. PAKDD is one of the top data mining conferences. The award ceremony will be on May 15,  in Tainan, Taiwan. Congratulations! SCS team and BBN and ARL collaborators win 'best student paper runner up' award, at PAKDD'14. The citation is: The paper describes a novel algorithm to spot time-evolving communities in large datasets. PAKDD is one of the top data mining 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