SCS team, alumni and colleagues attract the Best Paper award in CIKM’12!
Nov 1, 2012
The paper gives fast, scalable algorithms to strengthen (or weaken) a network, by careful edge additions (or removals), and gives applications on real graphs. The full citation is: The first two authors are SCS alumni (2010 and 2012, resp.), advised by the last author, SCS faculty Prof. Christos Faloutsos. CIKM is one of the top conferences in information retrieval and data mining with 1099 articles submitted this year, and only 146 of them accepted as full papers. Read More
Polo wins dissertation distinction!
Oct 24, 2012
Prof. Polo Chau wins the SCS Honorable Mention for his dissertation. Polo defended his dissertation with title "Data Mining Meets HCI: Making Sense Read More
Lei Li wins distinction!
Jul 16, 2012
Dr. Lei Li (SCS, phd'11) won the prestigious KDD best dissertation award (runner up), for his dissertation "Fast Algorithms for Mining Co-evolving Time Series". KDD is the premier Data Mining conference, with high competition from the best research groups in the world. Lei's thesis developed novel algorithms for forecasting, clustering and missing-value imputation for time sequences in a broad spectrum of settings, from motion-capture sequences to data-center monitoring to computer network ``BGP'' traffic mining. Warmest congratulations Lei! Read More
Mr. Alex Beutel wins NSF Fellowship!
Mar 24, 2012
We are delighted to announce that SCS doctoral student Mr. Alex Beutel was awarded the 2011 NSF Graduate Research Fellowship, (to be applied 2012-2015). The amount is $30,000 per year for up to three years. Congratulations Alex! Read More
Polo has an invited article in ACM Crossroads!
May 22, 2011
Polo speaks out on graph mining and fraud detection. Polo Chau has an invited article in ACM Crossroads, explaining how his work can help spot fraudsters Congratulations Polo! Read More
U Kang wins a ICDM 2010 NSF Student Travel Award!
Nov 5, 2010
U Kang is selected for the NSF Student Travel Award to attend the International Conference on Data Mining conference 2010 in Sydney, Australia. The award includes US $865 to cover the expenses incurred for attending the conference. Congratulations U! Read More
PEGASUS graph mining system wins ‘open source software’ award!
Oct 13, 2010
SCS team wins 3rd position (silver prize) in the Open Source Software World Challenge 2010, among 26 competing submissions. The team consists of graduate SCS students Mr. U Kang and Mr. Polo Chau, and advisor Christos Faloutsos, with several more contributors, listed on the project web site. The award includes $2000, plus travel expenses to accept the prize. The PEGASUS system is able to mine billion-node graphs, using parallelism and specifically, 'hadoop'. Code, documentation, instructions video and related papers are Read More
Leman Akoglu wins a Google ECML/PKDD 2010 Conference Grant!
Sep 24, 2010
Leman Akoglu wins the Google Conference and Travel grant for the ECML/PKDD 2010 that is offered to two female students to encourage more female computer scientists to attend and participate in the ECML/PKDD conference. The grant includes free registration for the main conference and up to 300 Euros for travel costs from Google. Congratulations Leman! Read More
Leman Akoglu wins the ‘best paper’ award in PKDD09
Sep 24, 2010
We are delighted to announce that Leman AKOGLU attracted the Best Knowledge Discovery Paper award in PKDD 2009, out of 105 papers that were accepted in the conference, and out 422 submissions. The paper was also accepted for publication in the Data Mining and Knowledge Discovery journal, for the ECML PKDD 2009 special issue. The paper is titled RTG: A Recursive Realistic Graph Generator using Random Typing by Leman Akoglu and Christos Faloutsos, ECML PKDD, Bled, Slovenia, Sep. 2009. ECML/PKDD 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