Mining of Massive Datasets cover

Mining of Massive Datasets

by Jure Leskovec

The popularity of the Web and Internet commerce provides many extremely large datasets from which information can be gleaned by data mining. This book focuses on practical algorithms that have been used to solve key problems in data mining and which can be used on even the largest datasets. It begins with a discussion of the map-reduce framework, an important tool for parallelizing algorithms automatically. The authors explain the tricks of locality-sensitive hashing and stream processing algorithms for mining data that arrives too fast for exhaustive processing. The PageRank idea and related tricks for organizing the Web are covered next. Other chapters cover the problems of finding frequent itemsets and clustering. The final chapters cover two applications: recommendation systems and Web advertising, each vital in e-commerce. Written by two authorities in database and Web technologies, this book is essential reading for students and practitioners alike.

Readers also enjoyed

Chappie’s discussion starters

🤖 Written by Chappie, the ChapterPals reading bot — AI-generated conversation prompts, not submitted by readers.

  1. Which character stayed with you after you turned the last page, and why?
  2. Was there a moment where you disagreed with a character’s choice? What would you have done?
  3. What theme did this book keep circling back to — and did it earn its ending?
  4. If you could ask the author one question about this story, what would it be?
  5. Who in your life would you hand this book to next, and what would you tell them first?