Image from Google Jackets

Mining of massive datasets / Anand Rajaraman, Jeffrey David Ullman.

By: Contributor(s): Publisher: Cambridge : Cambridge University Press, 2012Description: 1 online resource (x, 315 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781139058452 (ebook)
Subject(s): Additional physical formats: Print version: : No titleDDC classification:
  • 006.312 23
LOC classification:
  • QA76.9.D343 R35 2012
Online resources:
Contents:
Data mining -- Large-scale file systems and map-reduce -- Finding similar items -- Mining data streams -- Link analysis -- Frequent itemsets -- Clustering -- Advertising on the web -- Recommendation systems.
Summary: 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.
No physical items for this record

Title from publisher's bibliographic system (viewed on 18 Jul 2016).

Data mining -- Large-scale file systems and map-reduce -- Finding similar items -- Mining data streams -- Link analysis -- Frequent itemsets -- Clustering -- Advertising on the web -- Recommendation systems.

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.

There are no comments on this title.

to post a comment.