Prof. Christos Faloutsos wins PAKDD Distinguished Contributions Award
May 14, 2018
Prof. Christos Faloutsos attracted the PAKDD Distinguished Contribution Award, in the upcoming PAKDD 2018, in Melbourne, Australia. Quote from the conference web site: The Steering Committee considers it an honor to award the PAKDD Distinguished Contributions Award for 2018 to Professor Christos Faloutsos, for his many seminal contributions to the field of data mining, including time series matching, network analysis, graph computation, and their scalability. Especially notable is his highly successful program in showing how strong mathematical results can be Read More
Alex and Vagelis both win KDD-dissertation distinction!
Jul 10, 2017
Dr. Alex Beutel and Prof. Evangelos (Vagelis) Papalexakis, each attracted the ‘runner-up’ distinction for the prestigious SIGKDD doctoral dissertation award. SIGKDD is the flagship venue for data mining. Alex’s dissertation, titled ‘User Behavior Modeling with Large-Scale Graph Analysis’ focused on anomaly detection, by modeling normal and abnormal users, as well as on the design of scalable algorithms for large graphs. Vagelis’ dissertation, titled 'Mining Large Multi-aspect Data: Algorithms and Applications' bridged signal- and tensor-analysis, with data mining at scale, and Read More
CMU Wins SIGKDD 2016 ‘Best Research Paper’ Award
Aug 18, 2016
The Carnegie Mellon Database Group team won the Best Research Paper award in SIGKDD 2016 for their paper FRAUDAR: Bounding Graph Fraud in the Face of Camouflage. The authors were Bryan Hooi, Hyun Ah Song, Alex Beutel, Neil Shah, Kijung Shin, and Prof. Christos Faloutsos. KDD is the flagship data mining conference. The award ceremony was on Sunday Aug. 14, in San Francisco. The paper was selected out of over 700 submissions, and among 70 accepted papers. The paper gives Read More
Danai Koutra Wins 2016 SIGKDD Doctoral Dissertation Award
Jul 8, 2016
CS alumna Prof. Danai Koutra (now faculty at the University of Michigan Ann-Arbor) won the SIGKDD 2016 Dissertation award, for her thesis Exploring and Making Sense of Large Graphs The thesis contributes fast algorithms for summarizing large graphs, both static as well as time-evolving, and for contrasting two or more graphs, with applications to brain wiring, social networks, collaboration networks and more. SIGKDD is the premier conference for large-scale data mining. The competition for the dissertation award is fierce, with Read More
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
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
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