News

News

DB alumni mentioned in the MIT technology review!

Dec 18, 2013

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

Leman Akoglu and Mary McGlohon win the ‘best paper’ award at PAKDD 2010

Jul 13, 2010

SCS PhD students Leman Akoglu and Mary McGlohon receive the 'best paper' award at PAKDD 2010. The paper is titled OddBall: Spotting Anomalies in Weighted Graphs by Leman Akoglu, Mary McGlohon and Christos Faloutsos and gives fast algorithms to spot strange nodes in large social networks. PAKDD is one of the top data mining conferences. The paper was selected among 412 submissions, and 42 accepted full-papers. Congratulations, Leman and Mary! Read More

Fan’s paper among the best in this year’s KDD!

Jun 8, 2009

"BBM: Deriving Click Models from Petabyte-scale Data"" Read More

Leman’s paper among the best in ECML/PKDD’09

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

Babis’ paper among the best in ICDM’08

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

Jimeng Sun, SCS alumni ’07, wins the prestigious ‘best paper’ award in ICDM’08

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

Jure Leskovec in the news!

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

Jimeng Sun wins runner-up for SIGKDD best dissertation award

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

Polo Chau attracts publicity

Jun 23, 2008

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

Mary McGlohon wins a Yahoo Key Technical Challenge grant!

Feb 10, 2008

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