Mining Massive Datasets

The course is based on the text Mining of Massive Datasets by Jure Leskovec, Anand Rajaraman, and Jeff Ullman, who by coincidence are also the instructors for the course.

The book is published by Cambridge Univ. Press, but by arrangement with the publisher, you can download a free copy Here. The material in this on-line course closely matches the content of the Stanford course CS246.

The major topics covered include: MapReduce systems and algorithms, Locality-sensitive hashing, Algorithms for data streams, PageRank and Web-link analysis, Frequent itemset analysis, Clustering, Computational advertising, Recommendation systems, Social-network graphs, Dimensionality reduction, and Machine-learning algorithms.

• MapReduce systems and algorithms
• Locality-sensitive hashing
• Algorithms for data streams
• PageRank and Web-link analysis
• Frequent itemset analysis
• Clustering
• Computational advertising
• Recommendation systems
• Social-network graphs
• Dimensionality reduction
• Machine-learning algorithms