This class will be offered next in Winter 2022.
The first meeting of the class will be on Tuesday, January 4, 2022.

Logistics

Instructor

Co-Instructor

Course Coordinator


Content

What is this course about? [Info Handout]

The course will discuss data mining and machine learning algorithms for analyzing very large amounts of data. The emphasis will be on MapReduce and Spark as tools for creating parallel algorithms that can process very large amounts of data.
Topics include: Frequent itemsets and Association rules, Near Neighbor Search in High Dimensional Data, Locality Sensitive Hashing (LSH), Dimensionality reduction, Recommendation Systems, Clustering, Link Analysis, Large-scale Supervised Machine Learning, Data streams, Mining the Web for Structured Data, Web Advertising.

Previous offerings

The previous version of the course is CS345A: Data Mining which also included a course project. CS345A has now been split into two courses, CS246 and CS341.

You can access class notes and slides of previous versions of the course here:
CS246 Websites: CS246: Spring 2021 / CS246: Winter 2020 / CS246: Winter 2019 / CS246: Winter 2018 / CS246: Winter 2017 / CS246: Winter 2016 / CS246: Winter 2015 / CS246: Winter 2014 / CS246: Winter 2013 / CS246: Winter 2012 / CS246: Winter 2011
CS345a Website: CS345a: Winter 2010

Prerequisites

Students are expected to have the following background:

The recitation sessions in the first weeks of the class will give an overview of the expected background.

Reference Text

The following text is useful, but not required. It can be downloaded for free, or purchased from Cambridge University Press.
Leskovec-Rajaraman-Ullman: Mining of Massive Dataset


Schedule

Lecture slides will be posted here shortly before each lecture. If you wish to view slides further in advance, refer to last year's slides, which are mostly similar.

This schedule is subject to change. All deadlines are at 11:59pm PST.

Date Description Course Materials Events Deadlines
Tue Jan 4 Introduction; MapReduce and Spark
[slides]
Suggested Readings:
  1. Chapter 1: Data Mining
  2. Chapter 2: Large-Scale File Systems and Map-Reduce
Thu Jan 6 Frequent Itemsets Mining
[slides]
Suggested Readings:
  1. Ch6: Frequent itemsets
Colab 0,
Colab 1,
Homework 1
out
Recitation: Spark tutorial
[Colab]
Tue Jan 11 Locality-Sensitive Hashing I
[slides]
Suggested Readings:
  1. Ch3: Finding Similar Items (Sect. 3.1-3.4)
Thu Jan 13 Locality-Sensitive Hashing II
[slides]
Suggested Readings:
  1. Ch3: Finding Similar Items (Sect. 3.5-3.8)
Colab 2
Data
out
Colab 0,
Colab 1
due
Recitation: Probability and Proof Techniques
[handout]
Recitation: Linear Algebra
[handout]
Tue Jan 18 Clustering
[slides]
Suggested Readings:
  1. Ch7: Clustering (Sect. 7.1-7.4)
Thu Jan 20 Dimensionality Reduction
[slides]
Suggested Readings:
  1. Ch11: Dimensionality Reduction (Sect. 11.4)
Colab 3,
Homework 2
out
Colab 2,
Homework 1 due
Tue Jan 25 Recommender Systems I
[slides]
Suggested Readings:
  1. Ch9: Recommendation systems
Thu Jan 27 Recommender Systems II
[slides]
Suggested Readings:
  1. Ch9: Recommendation systems
Colab 4
Data
out
Colab 3
due
Tue Feb 1 PageRank
[slides]
Suggested Readings:
  1. Ch5: Link Analysis (Sect. 5.1-5.3, 5.5)
Thu Feb 3 Extensions of PageRank to Recommendations and Spam
[slides]
Suggested Readings:
  1. Ch5: Link Analysis (Sect. 5.4)
  2. Ch10: Analysis of Social Networks (Sect. 10.1-10.2, 10.6)
Colab 5,
Data Homework 3
out
Colab 4,
Homework 2 due
Tue Feb 8 Community Detection in Graphs
[slides]
Suggested Readings:
  1. Ch10: Analysis of Social Networks (Sect. 10.3-10.5)
Thu Feb 10 Graph Representation Learning
[slides]
Suggested Readings:
  1. Ch10: Analysis of Social Networks (Sect. 10.7-10.8)
Colab 6
out
Colab 5
due
Tue Feb 15 Graph Neural Networks
[slides]
Thu Feb 17 Learning Embeddings
[slides]
Colab 7,
Data,
Homework 4
out
Colab 6,
Homework 3 due
Tue Feb 22 Decision Trees
[slides]
Suggested Readings:
  1. Ch12: Large-Scale Machine Learning
Thu Feb 24 Mining Data Streams I & II
[slides]
Suggested Readings:
  1. Ch4: Mining data streams
Colab 8
out
Colab 7
due
Tue Mar 1 Matrix Sketching
[slides]
Practice Exam
Thu Mar 3 Computational Advertising
[slides]
Suggested Readings:
  1. Ch8: Advertising on the Web
Colab 9
Data
out
Colab 8,
Homework 4 due
Tue Mar 8 Learning through Experimentation
[slides]
Suggested Readings:
  1. A Contextual-Bandit Approach to Personalized News Article Recommendation by Li, Chu, Langford, Schapier. WWW 2010.
Thu Mar 10 Optimizing Submodular Functions
[slides]
Suggested Readings:
  1. Turning Down the Noise in the Blogosphere by El-Arini, Veda, Shahaf, Guestrin. KDD 2009.
Colab 9
due