Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Stanford University

Mining Massive Datasets

Stanford University via edX

Overview

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.

Taught by

Jure Leskovec, Anand Rajaraman, Jeff Ullman and

Reviews

4.5 rating, based on 24 Class Central reviews

Start your review of Mining Massive Datasets

  • Anonymous
    This is a course with interesting content but that is somewhat lacking in pedagogy.
    The course has a lot of good content, notably from J.Ullman, but course sessions are very long, pedagogy is not optimal.
    The course is a huge time investment with dense content all along the 7 weeks or so. If you can get over this it will be very rewarding but not everyone has that kind of time available.
    That course would probably be better off cut in smaller chunks or offered as a self-paced course.

    Also the fact the course doesn't offer verified certificate will make think twice before investing so much time in it.
  • Anonymous
    I found the lecture to be of medium difficulty for the post-grad student and I would expect it to be rather hard for an undergrad. The content is offered in two paces; the lectures of Prof. Ullman are hard to follow, as he browses quickly through m…
  • HChan
    Excellent course by the authors, covering the content of the book of the same name http://www.amazon.com/gp/product/1107077230. It is the MOOC version of http://cs246.stanford.edu. Many useful topics in large scale data processing algorithms are cov…
  • Very interesting course covers a lot of topics. It is rather difficult and takes a lot of time (only lectures usually take around 3 hours/week and it's hard to watch them faster than 1.25x). The only disappointment for me was lectures taught by prof Ullman, was very hard to fallow his monotonic reading, other two lecturers have strong accents but were much more alive and understandable.
  • I loved this course, and I'm recommending it to everyone. It's hugely time consuming, however, there are two tracks - the basic one and the advanced one. Since the basic one was tough for me, I'm looking forward to taking this course again, and try out the advanced one, since I had no time for it in the first run of this course. I'm glad to see it had more future runs, it surely deserves it. All the instructors were great, and I loved the way how they explained difficult concepts with various analogies and illustrations. The forum discussions were great, but the course lacks some programming assignments to try to see these approaches in practice, or perhaps to make it a bit longer. Great, great job!
  • Klaas Naaijkens
  • César Alba
  • Vlad Podgurschi
  • José Diaz Seng
  • Profile image for Paweł Klimczuk
    Paweł Klimczuk
  • Profile image for Alex Ivanov
    Alex Ivanov
  • Aditya Choudhary
  • Mike Rocke

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.