DeepRead
Cover of Mining of massive datasets

About the book

A textbook on data mining for datasets too large to fit in memory on one machine. It draws on Stanford's CS246 and CS345A courses and covers distributed file systems and MapReduce, along with the algorithms built on them: similarity search, frequent itemsets, clustering, link analysis and PageRank, recommender systems, and mining data streams. Its central claim is that at web scale, the usual textbook algorithms stop working, so mining has to be redesigned around the cost of moving and reading data. Methods should be parallelizable, and approximate techniques such as minhashing and locality-sensitive hashing are often preferable to exact computation. The book also argues that many practical problems, including finding similar items, recommendation, and ranking pages, reduce to a small set of core primitives that can be implemented efficiently on clusters.

Written by Claude from what it knows of this book.

What Hacker News says 85% recommend · 0% critical

02.5520112015202020232015 peak · 5
This bookAverage book in Bayesian and probabilistic modeling

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 11 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2012
ISBN
9781108476348
Editions known
12 at Open Library
Open Library
OL16970048W

CommerceData miningDatabase management

Explore in the mosaic

Read next: its neighbours on the mosaic