Clustering

Apache Spark

Frequent Itemsets Mining

Locality-Sensitive Hashing

Dimensionality Reduction

Recommender Systems

PageRank

Community Detection in Graphs

Graph Representation Learning

Graph neural network (GNN)

Learning Embeddings

Decision Trees

Mining Data Streams

Matrix Sketching

Computational Advertising

Learning through Experimentation

Optimizing Submodular Functions

CS246: Mining Massive Data Sets Stanford University Spring 2023 This course focuses on data mining and machine learning algorithms for large scale data analysis. The emphasis is on parallel algorithms with tools like MapReduce and Spark. Topics include frequent itemsets, locality sensitive hashing, clustering, link analysis, and large-scale supervised machine learning. Familiarity with Java, Python, basic probability theory, linear algebra, and algorithmic analysis is required. ### What is this course about? [[Info Handout](https://web.stanford.edu/class/cs246/handouts/CS246_Info_Handout.pdf)]

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](http://spark.apache.org/) 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.  Students are expected to have the following background:

- Knowledge of basic computer science principles and skills, at a level sufficient to write a reasonably non-trivial computer program (e.g., CS107 or CS145 or equivalent are recommended).
- Good knowledge of Java and Python will be extremely helpful since most assignments will require the use of Spark.
- Familiarity with basic probability theory (CS109 or Stat116 or equivalent is sufficient but not necessary).
- Familiarity with writing rigorous proofs (at a minimum, at the level of CS 103).
- Familiarity with basic linear algebra (e.g., any of Math 51, Math 103, Math 113, CS 205, or EE 263 would be much more than necessary).
- Familiarity with algorithmic analysis (e.g., CS 161 would be much more than necessary). ### 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](http://www.mmds.org/)

CS246: Mining Massive Data Sets

Machine Learning

Online Learning

Stochastic gradient descent (SGD)

PAC Learning

Error Decomposition

Boosting

Decision Making

Gradient descent

Similarity Learning

Neural Networks Learning

Mathematical Optimization

Multiclass Learning

Neural network

COS 324 - Introduction to Machine Learning Princeton University Fall 2017 A thorough introduction to machine learning principles such as online learning, decision making, gradient-based learning, and empirical risk minimization. It also explores regression, classification, dimensionality reduction, ensemble methods, neural networks, and deep learning. The course material is self-contained and based on freely available resources. The course provides an introduction to machine learning.

**Topic covered**:

- Online learning and decision making
- Learning from examples and generalization
- Empirical risk minimization and regularization
- Introduction to convex analysis
- Gradient-based learning
- Implementation and analysis of learning algorithms for regression, binary classification, multiclass categorization, and ranking problems
- Dimensionality reduction methods
- Ensemble methods and boosting
- Neural networks and deep learning
- Markov decision precesses    **NOTICE:**  All material of the course is self-contained and based on freely available books and surveys.   
Main references:

- [Understanding Machine Learning: From Theory to Algorithms](http://www.cs.huji.ac.il/~shais/UnderstandingMachineLearning/), by Shai Shalev-Shwartz and Shai Ben-David
- [Online convex optimization](http://ocobook.cs.princeton.edu/), by Elad Hazan
- [Machine Learning](http://www.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html), by Tom Mitchell
- An Introduction to Computational Learning Theory, by Michael Kearns &amp; Umesh Vazirani
- Machine Learning: A Probabilistic Perspective, by Kevin Murphy,

Further advanced references: - [Convex Optimization](http://stanford.edu/~boyd/cvxbook/), by Stephen Boyd and Lieven Vandenberghe
- [Convex optimization: algorithms and complexity](https://arxiv.org/abs/1405.4980), by Sebastien Bubeck
- Artificial Intelligence: A Modern Approach, by Stuart Russell and Peter Norvig

Python Tutorials - [An interactive python tutorial](https://learnpython.org/) from LearnPython.com
- [Tutorial for Python 2.7](https://docs.python.org/2.7/tutorial/) from python.org
- [Tutorial for Python 3](https://docs.python.org/3/tutorial/) from python.org

COS 324 - Introduction to Machine Learning

Cluster analysis

Clustering

2 courses cover this concept

CS246: Mining Massive Data Sets

COS 324 - Introduction to Machine Learning