Posted: February 9, 2009 ┃ Category: Fellowship

Mr. Duen Horng (Polo) CHAU wins a 2009 Symantec Fellowship, second year in a row! Polo is in the MLD PhD program, working on visualization and anomaly detection for large graphs. The Symantec Graduate Fellowship program was established to identify and support exceptional graduate students who are investigating novel ways to solve real-world problems in protecting security and availability. In addition to the financial support, Polo will have the opportunity to work directly with Symantec’s top researchers on new investigations Mr. Duen Horng (Polo) CHAU wins a 2009 Symantec Fellowship, second year in a row! Polo is in the MLD PhD program, working on visualization and anomaly detection for large graphs. The Symantec Graduate Fellowship program was established to identify Read More

Posted: January 28, 2009 ┃ Category: Awards

Charalampos (Babis) Tsourakakis had a paper that was invited for fast-track publication, as one of the best in ICDM'08. Babis is a PhD student at SCS/MLD. ICDM is one of the top data mining conferences, and the paper gives an extremely fast method (1000x faster) to compute triangles in social networks. The details of the paper are "Fast Counting of Triangles in Large Real Networks Charalampos (Babis) Tsourakakis had a paper that was invited for fast-track publication, as one of the best in ICDM'08. Babis is a PhD student at SCS/MLD. ICDM is one of the top data mining conferences, and the paper gives an Read More

Posted: January 7, 2009 ┃ Category: Awards

ICDM is one of the top data mining conferences. The paper proposed MET (Memory Efficient Tucker) decomposition, to handle large sparse tensors, a vital problem for time-evolving graphs, among other applications. The paper citation is: T. G. Kolda and J. Sun, "Scalable Tensor Decompositions for Multi-aspect Data Mining ICDM is one of the top data mining conferences. The paper proposed MET (Memory Efficient Tucker) decomposition, to handle large sparse tensors, a vital problem for time-evolving graphs, among other applications. The paper citation is: T. G. Kolda and J. 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

Posted: July 1, 2008 ┃ Category: Awards

Dr. Jimeng Sun (Ph.D. CMU-CSD 2007) attracted the runner-up award for the best SIGKDD dissertation. Jimeng's dissertation is on tensor and stream mining, proposing novel and efficient methods to handle streams of numerical data, as well as streams of graphs. He applied his methods on chlorine monitoring in the drinking water (joint project with Prof. Jeanne VanBriesen of CIT/CMU), on monitoring the self-star data center of PDL/CMU (with Prof. Greg Ganger and his group), and also on monitoring computer traffic Dr. Jimeng Sun (Ph.D. CMU-CSD 2007) attracted the runner-up award for the best SIGKDD dissertation. Jimeng's dissertation is on tensor and stream mining, proposing novel and efficient methods to handle streams of numerical data, as well as streams of graphs. Read More

Posted: June 23, 2008 ┃ Category: In-the-News

Polo Chau attracts publicity in popular media. WJS-online, CNN-Money, Pittsburgh Tribute-Review and others, mention Polo and the prestigious fellowship he received from Symantec. Congratulations, Polo! Polo Chau attracts publicity in popular media. WJS-online, CNN-Money, Pittsburgh Tribute-Review and others, mention Polo and the prestigious fellowship he received from Symantec. Congratulations, Polo! Read More

Posted: February 10, 2008 ┃ Category: Fellowship

The Key Technical Challenges Program is a new Yahoo! program that provides a limited number of exceptional PhD students with $5,000 each of unrestricted funds for the support of their research activities". The award also includes an exclusive invitation to a Yahoo! organized workshop that will focus on novel disciplines and important technical challenges for the Internet research community. The Key Technical Challenges Program is a new Yahoo! program that provides a limited number of exceptional PhD students with $5,000 each of unrestricted funds for the support of their research activities". The award also includes an exclusive invitation to Read More