Midterm Presentations
CS522, Fall 2008

Monday 11/3 and Wednesday 11/5

Please upload your midterm presentation slides to CSNS. One submission from each group is sufficient. Note that file uploading will be disabled automatically after 11:59PM of the due date, so please turn in your work on time.

Midterm presentations will be group presentations, and each group should consist of three or four students. Each group must choose to present one of the papers listed in the Papers section. Each group member must present at least 10 minutes, and each presentation must be at least 30 minutes and no more than 45 minutes. Please let me know what paper you choose by Friday, October 24. Paper selection is first-come-first-serve.

Your presentation should cover the following aspects of the paper you selected:

And here are some of the things I'll look for in each presenter:

Total points for the midterm presentation is 20, half of which is for the presentation as a whole, and the other half is for individual performance.



  1. Optimization of Frequent Itemset Mining on Multiple-Core Processor, by Li Liu, Eric Li, Yimin Zhang, Zhizhong Tang.
  2. Shared Memory Parallelization of Data Mining Algorithms: Techniques, Programming Interface, and Performance, by Ruoming Jin, Ge Yang, and Gagan Agrawal.
  3. PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth, by Jian Pei, Jiawei Han, Behzad Mortazavi-Asl, Helen Pinto, Qiming Chen Umeshwar Dayal Mei-Chun Hsu.
  4. Integrating Classification and Association Rule Mining (pdf), by Bing Liu, Wynne Hsu, Yiming Ma.
  5. Demographic Prediction Based on User's Browsing Behavior, by Jian Hu, Hua-Jun Zeng , Hua Li, Cheng Niu, Zheng Chen.