CS 550: Massive Data Mining and Learning |
Course Information
Instructor: | Yongfeng Zhang |
Email: | yongfeng.zhang AT rutgers.edu |
Office: | CBIM 20 |
Time: | Monday and Thursdays, 12:00-1:20 pm |
Location: | Allison Road Classrooms (ARC) 107 |
Office Hours: | Fridays 2:00-4:00pm or by appointment |
TA: | Sepehr Janghorbani |
Email: | sj620 At scarletmail.rutgers.edu |
Office: | Hill 202 |
TA Office Hours: | Wednesdays 12:00pm-2:00pm or by appointment |
Textbook: | (LRU) Mining Massive Data Sets by J. Leskovec, A. Rajaraman, J. D. Ullman |
Announcements
Course Descriptions
This class introduce computing infrastructurs, algorithms, thories, and practice of massive data analytics and machine learning, as well as their application in frequently used scenarios, including recommender systems, web search, social networks, computational advertising, smart city, etc. Students will learn algorithms to store, process, mine, analyze, and synthesize streaming data, or data at rest that does not fit in Random Access Memory. The material covered here equips students with the main backend algorithms and infrastructure for the Capstone Project and research tasks closely related with data science and analytics.
Prerequisites
Expected Work
The midterm is closed-book, but you are allowed to bring 1 letter-sized page of note that you prepared by yourself.
Self-proposed projects should be equal to or exceed the amount of work of the assigned project, and the proposed project is subject to pre-approval by the instructor.
Tentative Schedule
Note that the schedule may be subject to change (e.g., due to snow or campus close). Please check the course website frequently for the latest schedule.
Introduction, Map Reduce I (Reading: Ch 1, Ch 2.1-2.4) | ||
1/25 |
Map Reduce II (Reading: Ch 2.1-2.4) Association Rule Mining (Reading: Ch 6) |
|
2/1 |
Frequent Item Sets Mining (Reading: Ch 6) Locally Sensitive Hashing I (Reading: Ch 3.1-3.4) |
|
2/8 |
Locally Sensitive Hashing II (Reading: Ch 3.5-3.8) Clustering, similarity, k-means, BFR (Reading: Ch 7.1-7.4) |
|
2/15 |
Dimensionality Reduction, SVD (Reading: Ch 11.1-11.3) Dimensionality Reduction, CUR (Reading: Ch 11.4-11.5) |
|
2/22 |
Content-based Recommendation (Reading: Ch 9.1-9.2) Collaborative Filtering, Latent Factor Models (Reading: Ch 9.3-9.4) |
|
3/1 |
Learning to Rank and Deep Learning for RS, Project Description Link Analysis, Page Rank (Reading: Ch 5.1-5.3, 5.5) |
|
3/8 |
Web Spam, Trust Rank (Reading: Ch 5.4) Mid-term exam |
|
3/15 |
No class, Spring recess | |
3/22 |
Social Networks, Community Detection (Reading: Ch 10.1-10.2, 10.6) Spectral Clustering, Trawling (Reading: Ch 10.1-10.2, 10.6) |
|
3/29 |
Overlapping Communities (Reading: Ch 10.3-10.5, 10.7-10.8) Large-scale Machine Learning I (Reading: Ch 12) |
|
4/5 |
Large-scale Machine Learning II (Reading: Ch 12) Mining Data Streams I (Reading: Ch 4.1-4.3) |
|
4/12 |
Mining Data Streams II (Reading: Ch 4.4-4.7) Guest Lecture: Case Study in Smart Cities |
|
4/19 |
Computational Advertising (Reading: Ch 8) Learning through Experimentations with Bandit-based Learning |
|
4/26 |
Project Presentations I Project Presentations II |
|
Course Review |