News

CMU Team Wins 2016 SIGKDD ‘Test of Time’ Award

Jul 8, 2016

CMU team wins the ‘Test of Time’ award at KDD 2016 for their 2005 paper: Graphs Over Time: Densification Laws, Shrinking Diameters and Possible Explanations Jure Leskovec, Jon Kleinberg, and Christos Faloutsos KDD is the flagship conference for large-scale data mining. Jure was a phd student at SCS/MLD (and currently a professor at Stanford). Jon was visiting CMU for his sabbatical. The paper made the surprising discoveries that real graphs become denser over time, following a power-law pattern, and that Read More

Vagelis and Leman win ‘best paper’ awards in SDM’16

May 22, 2016

SIAM SDM is one of the top conferences in data mining. Specifically, Vagelis  attracted the 'best student paper award', with his single-author paper on tensors   Evangelos E. Papalexakis, Automatic Unsupervised Tensor Mining with Quality Assessment There, Vagelis showed how to measure the goodness of a tensor decomposition, and how to automatically determine the correct rank of such a decomposition. Moreover, CMU/SCS alumna Prof. Leman Akoglu, and her student,  attracted the 'best  paper runner-up award' for their paper on anomaly Read More

Joy Arulraj Wins 2016 Samsung PhD Fellowship

Apr 23, 2016

CMU DB Ph.D. student and teenage heartthrob Joy Arulraj won a Samsung 2017 PhD Fellowship in the area of Software and Memory System Solutions for Data Centers. Joy's research is on developing the novel database management system architectures for emerging non-volatile memory technologies to support modern hybrid transactional/analytical processing (HTAP) applications. The Samsung PhD Fellowship program awards outstanding graduate students working on cutting-edge research for innovative solutions to their fields’ biggest problems. More information about the Samsung PhD Fellowship program. Read More

Dana Van Aken Wins 2016 National Science Foundation Graduate Fellowship

Apr 11, 2016

CMU DB Ph.D. student Dana Van Aken won a National Science Foundation Graduate Fellowship. Dana's research is focused on using machine learning techniques for automatic database management system tuning and configuration. NSF's Graduate Research Fellowship Program supports outstanding student researchers pursuing graduate degrees in science, technology, engineering and mathematics who demonstrate the potential to have a significant impact in their fields. Almost 17,000 students applied for a total of 2,000 fellowships awarded nationwide. More Information about the NSF Graduate Fellowship Read More

Vagelis invited to Dagstuhl

Mar 29, 2016

Vagelis has been invited to participate in Dagstuhl Perspectives Workshop,"Tensor Computing for Internet of Things" (16152), to be held at Schloss Dagstuhl in Germany from Sunday, April 10 to Wednesday, April 13, 2016. Schloss Dagstuhl, a nonprofit institution with associates from eleven universities and research organizations, is one of the world's leading research centers in informatics. It has been hosting invitation-only Dagstuhl Seminars and Dagstuhl Perspectives Workshops since the center's founding in 1990. More information about Schloss Dagstuhl and our Read More

Alumnus win Lagrange Prize

Mar 19, 2016

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

Summer 2016 Research Internships

Nov 1, 2015

The Carnegie Mellon Database Group is offering multiple internship positions for a special summer research project at its Pittsburgh, Pennsylvania campus. It will be an intense 12-week internship from June to August 2016. The project will be to work on a new open-source distributed database system from scratch. Thus, we are looking for candidates that have strong systems-level C/C++ programming skills. Interns will be paid a three-month summer salary (commensurate with skills and experience) and the cost of travel expenses. Read More

Danai’s dissertation wins multiple distinctions!

Oct 31, 2015

Danai's dissertation won both the nomination for the  ACM Doctoral Dissertation award, as well as one of the three Honorable mentions for the SCS Doctoral Dissertation award. CMU/SCS is allowed to nominate two dissertations for the ACM award. The full announcement by the Dean  is below: We are pleased to give you the 2015 selections for the SCS/ECE Nominations to ACM for the Doctoral Dissertation Award and the winner of the SCS Doctoral Dissertation award for 2015: ACM Nomination & Read More

CMU/SCS team wins ICDM ’10-year highest impact’ paper award.

Oct 15, 2015

CMU/SCS team and alumni win the ICDM 2015 10-year highest impact paper award, for the paper Fast Random Walk with Restart and Its Applications by Hanghang Tong, Christos Faloutsos, and Jia-Yu Pan. ICDM is one of the top data mining conferences. The paper had also won the 'best research paper' award that year. It shows how to quickly compute the so-called 'personalized random walk with restarts', to estimate node proximity, with applications in image captioning and co-authorship graphs. The paper Read More

CMU team wins ‘test of time’ award in ECML/PKDD 2015

Sep 8, 2015

The paper details are: Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos: Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication. ECML/PKDD 2005: 133-145 ECML/PKDD is one of the top data mining conferences. Both Jure and Deepayan were SCS phd students in 2005, advised by Christos, while Jon was on sabbatical at CMU. Both Jure and Deepayan are now tenure-track faculty, at Stanford and U.Texas-Austin, respectively. The paper showed how to generate realistic graphs, using recursion and self-similarity. Read More