Due to the COVID-19, this course will be delivered over Zoom: https://ucsd.zoom.us/j/97017584161
This course mainly focuses on introducing current methods and models that are useful in analyzing and mining real-world data. It will cover frequent pattern mining, regression & classification, clustering, and representation learning. No previous background in machine learning is required, but all participants should be comfortable with programming, and with basic optimization and linear algebra.
There is no textbook required, but here are some recommended readings:
- The classical data mining textbook “Data Mining: Concepts and Techniques” by Jiawei Han et al.
- The classical data mining/machine learning book “Pattern Recognition and Machine Learning” by Christopher M. Bishop
- The new “Dive into Deep Learning” book by Aston Zhang et al.
Math, Stats, and Coding:
(CSE 12 or DSC 40B) and (CSE 15L or DSC 80) and (CSE 103 or ECE 109 or MATH 181A or ECON 120A or MATH 183)
TAs and Tutors
- Teaching Assistants: Dheeraj Mekala (dmekala AT eng.ucsd.edu)
- Tutors: Zhenyu Bi (z1bi AT ucsd.edu), Yang Li (yang AT ucsd.edu), and Tiange Wan (t2wan AT ucsd.edu)
- Jingbo Shang
- Office Hour: Wednesdays, 10 to 11 AM
- Zoom link: https://ucsd.zoom.us/my/jshang
- Dheeraj Mekala
- Office Hour: Wednesdays, 2 to 3 PM
- Zoom link: https://ucsd.zoom.us/j/97330988404
- Zhenyu Bi
- Office Hour: Thursdays, 8 to 8:30 PM
- Zoom link: https://ucsd.zoom.us/j/6198663088
- Yang Li
- Office Hour: Fridays 10 to 10:30 AM
- Zoom link: https://ucsd.zoom.us/my/ucsd.yangli
- Tiange Wan
- Office Hour: Tuesdays 6 PM to 6:30 PM
- Zoom link: https://ucsd.zoom.us/j/4215654888
Note: all times are in Pacific Time.
- Homework: 8% each. Your lowest (of four) homework grades is dropped (or one homework can be skipped).
- Midterm: 26%.
- Data Mining Challenge: 25%.
- Project: 25%.
- You should complete all work individually, except for the Project.
- Late submissions are NOT accepted.
Recording Note: Please download the recording video for the full length. Dropbox website will only show you the first one hour.
HW Note: All HWs due before the lecture time 9:30 AM PT in the morning.
|Week||Date||Topic & Slides||Events|
|1||01/05 (Tue)||Introduction: Data Types, Tasks, and Evaluations [slides] [annotated_slides] [recording]||HW1 out|
|1||01/07 (Thu)||Supervised - Least-Squares Regression and Logistic Regression [slides] [annotated_slides] [recording]|
|2||01/12 (Tue)||Supervised - Overfitting and Regularization [slides] [annotated_slides] [recording]||HW1 Due, HW2 out|
|2||01/14 (Thu)||Supervised - Support Vector Machine [slides] [annotated_slides] [recording]|
|3||01/19 (Tue)||Supervised - Naive Bayes and Decision Tree|
|3||01/21 (Thu)||Supervised - Ensemble Learning: Bagging and Boosting|
|4||01/26 (Tue)||Cluster Analysis - K-Means Clustering & its Variants||HW2 Due, HW3 out|
|4||01/28 (Thu)||Cluster Analysis - “Soft” Clustering: Gaussian Mixture|
|5||02/02 (Tue)||Cluster Analysis - Density-based Clustering: DBSCAN|
|5||02/04 (Thu)||Cluster Analysis - Principle Component Analysis||DM Challenge out|
|6||02/09 (Tue)||Pattern Analysis - Frequent Pattern and Association Rules|
|6||02/11 (Thu)||Midterm (24 hours on this date)|
|7||02/16 (Tue)||Recommender System - Collaborative Filtering||HW3 Due, HW4 out|
|7||02/18 (Thu)||Recommender System - Latent Factor Models|
|8||02/23 (Tue)||Text Mining - Zipf’s Law, Bags-of-words, and TF-IDF|
|8||02/25 (Thu)||Text Mining - Advanced Text Representations||DM Challenge due|
|9||03/02 (Tue)||Network Mining - Small-Worlds & Random Graph Models|
|9||03/04 (Thu)||Network Mining - HITS, PageRank, Personalized PageRank and Node Embedding|
|10||03/09 (Tue)||Sequence Mining - Sliding Windows and Autoregression|
|10||03/11 (Thu)||Text Data as Sequence - Named Entitry Recognition||HW4 Due|
Your lowest (of four) homework grades is dropped (or one homework can be skipped).
- HW1: Concepts and Evaluations (8%). This homework mainly focuses on the data mining concepts and how to evaluate different tasks.
- HW2: Regression and Classification (8%). This homework mainly focuses on regression and classification tasks.
- HW3: Cluster and Pattern Analysis (8%). This homework mainly focuses on clustering methods and frequent pattern mining methods.
- HW4: Applications (8%). This homework mainly focuses on recommender system, text mining, and network mining.
It is an open-book, take-home exam, which covers all lectures given before the Midterm. Most of the questions will be open-ended. Some of them might be slightly more difficult than homework. You will have 24 hours to complete the midterm, which is expected for about 2 hours.
- Start: Feb 11, 9:30 AM PT
- End: Feb 12, 9:30 AM PT
- Midterm problems download: TBD
- Please make your submissions on Gradescope.
Data Mining Challenge (25%)
It is a individual-based data mining competition with quantitative evaluation. The challenge runs from Feb 4 0:00:01 AM to Feb 25 4:59:59 PM PT. Note that the time displayed on Kaggle is in UTC, not PT.
- Challenge Statement, Dataset, and Details: TBD.
- Kaggle challenge link: TBD.
Instructions for both choices are available here: TBD. Project due on Mar 12.
Here is a quick overview:
- Choice 1: Team-Based Open-Ended Project
- 1 to 4 members per team. More members, higher expectation.
- Define your own research problem and justify its importance
- Come up with your hypothesis and find some datasets for verification
- Design your own models or try a large variety of existing models
- Write a 4 to 8 pages report (research-paper like)
- Submit your codes
- Up to 5% bonus for working demos/apps towards the total course grade.
- Choice 2: Individual-Based Deep Dive into Data Mining Methods
- Implement a few models learned from this course from scratch.
- Skeleton codes will be provided. Your work is more like “filling in blanks”.
- Each model has a point associated with it. 6 points required.
- Write a report (pages based on points) describing your interesting findings.
- Up to 5% bonus towards the total course grade. Roughly 1 point, 1%.