Danai’s dissertation wins multiple distinctions!
Posted: October 31, 2015 ┃ Category: Awards
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 & 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 Read More
CMU/SCS team wins ICDM ’10-year highest impact’ paper award.
Posted: October 15, 2015 ┃ Category: Awards
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 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 Read More
CMU team wins ‘test of time’ award in ECML/PKDD 2015
Posted: September 8, 2015 ┃ Category: Awards
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. 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 Read More
The Databaseology Lectures – Seminar Series (Fall 2015)
Posted: August 23, 2015 ┃ Category: Annoucements
The CMU Database group is holding a semester-long seminar series with the leading developers of embedded database management systems. The Databaseology Lectures is designed to showcase some of the newer technologies available for embedded and mobile applications. Each speaker will present the implementation details of their respective systems and examples of the technical challenges that they faced when working with real-world customers. The list of confirmed speakers are: Sep 10 - Keith Bostic (WiredTiger) Sep 17 - D. Richard Hipp The CMU Database group is holding a semester-long seminar series with the leading developers of embedded database management systems. The Databaseology Lectures is designed to showcase some of the newer technologies available for embedded and mobile applications. Each speaker will Read More
Alumna Prof. Leman Akoglu wins SDM best-paper award!
Posted: May 7, 2015 ┃ Category: Awards
SCS and database group alumna Prof. Leman Akoglu wins prestigious 'best paper' award! Leman is an assistant professor at Stonybrook (phd CMU '12), and she attracted the award at SDM, one of the flagship data mining conferences. The full citation is Where Graph Topology Matters: The Robust Subgraph Problem Hau Chan, Shuchu Han, and Leman Akoglu. SIAM SDM, Vancouver, BC, Canada, April 2015. The contributions are fast, practical algorithms to find well-connected sub-graphs, within a large, real graph, as well SCS and database group alumna Prof. Leman Akoglu wins prestigious 'best paper' award! Leman is an assistant professor at Stonybrook (phd CMU '12), and she attracted the award at SDM, one of the flagship data mining conferences. The full citation Read More
Summer 2015 Research Internships
Posted: November 17, 2014 ┃ Category: Annoucements
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 2015. The project will be to develop a new open-source distributed main-memory database system from scratch. Thus, we are looking for candidates that have strong C/C++ and SQL programming skills. Interns will be paid a three-month summer salary (commensurate with skills and experience) and the cost of travel 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 2015. The project will be to develop a Read More
Flavio Figueiredo wins 1st place in two out of the three tasks of the ECML/PKDD Predictive Analytics Challenge
Posted: October 3, 2014 ┃ Category: Awards
Flavio was a visiting scholar with the database group at SCS during 2014-15. The challenge was to predict the popularity of a web page time series using 1h of data. Popularity was measured in the number of visits, Facebook likes and mentions the page receives on Twitter. The target time for predictions was 48h. Thus, given 1h worth of activity, the task was to predict the popularity (= amount of activity) of a page, for the next 48 hours. Flavio's Flavio was a visiting scholar with the database group at SCS during 2014-15. The challenge was to predict the popularity of a web page time series using 1h of data. Popularity was measured in the number of visits, Facebook likes Read More
Seven Databases in Seven Weeks – Seminar Series (Fall 2014)
Posted: September 10, 2014 ┃ Category: Annoucements
The CMU Database group is holding a semester-long seminar series with the leading developers of NoSQL and NewSQL database management systems. Seven Databases in Seven Weeks is designed to showcase some of the newer technologies available for front-end application developers today. Each speaker will present the implementation details of their respective systems and examples of the technical challenges that they faced when working with real-world customers. The list of confirmed speakers are: Sep 11 - Ankur Goyal (Director of Engineering, The CMU Database group is holding a semester-long seminar series with the leading developers of NoSQL and NewSQL database management systems. Seven Databases in Seven Weeks is designed to showcase some of the newer technologies available for front-end application developers Read More
Danai invited to ‘2014 Rising Stars’ workshop!
Posted: July 29, 2014 ┃ Category: Awards
Danai is invited to the 2014 Rising Stars in EECS: An Academic Career Workshop for Women, which will be hosted by UC Berkeley's EECS Department on November 3rd and 4th, 2014. This workshop will bring together approximately 40 outstanding EECS graduate and postdoctoral women, for two days of scientific/technical information exchange and career-oriented discussions on topics including the pros/cons of academia, finding a faculty position, and keys to success as a junior faculty member. Danai will have the opportunity to Danai is invited to the 2014 Rising Stars in EECS: An Academic Career Workshop for Women, which will be hosted by UC Berkeley's EECS Department on November 3rd and 4th, 2014. This workshop will bring together approximately 40 outstanding EECS Read More
Alex and colleagues produce one of KDD ‘best 9 papers’
Posted: July 29, 2014 ┃ Category: Awards
The paper CatchSync : Catching Synchronized Behavior in Large Directed Graphs, by Meng Jiang, Peng Cui, Alex Beutel, Christos Faloutsos and Shiqiang Yang, was selected for fast-track publication, as one of the 9 best papers that will appear in KDD'14. The paper describes a novel, automatic method to spot lock-step behavior in large social networks. Lockstep behavior is usually a sign of fraud. Meng was a post-doc visitor at CMU, working on anomaly detection in large graphs. Congratulations, Alex and The paper CatchSync : Catching Synchronized Behavior in Large Directed Graphs, by Meng Jiang, Peng Cui, Alex Beutel, Christos Faloutsos and Shiqiang Yang, was selected for fast-track publication, as one of the 9 best papers that will appear in KDD'14. Read More