Jun 6, 2009

The paper RTG: A Recursive Realistic Graph Generator using Random Typing by Leman Akoglu and Christos Faloutsos was accepted to ECML/PKDD'09, and, as one of the best 14 papers, is invited for immediate journal publication, out of 422 submissions and 105 acceptances. Leman is a PhD student in SCS, and ECML/PKDD is one of the top conferences in data mining. The paper describes a simple, intuitive mechanism to generate realistic graphs, and it shows that the resulting graphs obey numerous Read More

May 21, 2009

Prof. Jure Leskovec wins the prestigious ACM SIGKDD dissertation award! Jure defended his dissertation in MLD in September of 2009. The title is "Dynamics of Large Networks that hold for real graphs as well as several powerful tools to study blogs instant-message networks social networks like LinkedIn and other types of real graphs. ACM SIGKDD is the premier society for data mining research and the above award is the highest distinction for a Ph.D. dissertation in the area. The award Read More

May 15, 2009

Mr. Polo Chau wins a Yahoo Key Technical Challenge grant! The grant is awarded to a limited number of exceptional Ph.D. students and it carries a gift of $5,000 unrestricted funds to support their research activities. The award also includes an exclusive invitation to the KSC graduate student Summit, where Polo will have the chance to get feedback and interact with some of the best Yahoo scientists. Congratulations, Polo! Read More

Feb 9, 2009

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 Read More

Jan 28, 2009

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 Read More

Jan 7, 2009

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 Read More

Sep 30, 2008

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 Read More

Jul 1, 2008

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 Read More