Mining of Massive Datasets (Hardcover, 2nd Revised edition)

Written by leading authorities in database and Web technologies, this book is essential reading for students and practitioners alike. 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 can be applied successfully to 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. Other chapters cover the PageRank idea and related tricks for organizing the Web, the problems of finding frequent itemsets and clustering. This second edition includes new and extended coverage on social networks, machine learning and dimensionality reduction.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	November 2014
Authors:	Jure Leskovec • Anand Rajaraman • Jeffrey David Ullman
Dimensions:	255 x 180 x 33mm (L x W x T)
Format:	Hardcover
Pages:	467
Edition:	2nd Revised edition
ISBN-13:	978-1-107-07723-2
Categories:	Books > Computing & IT > Applications of computing > Databases > Data capture & analysis Books > Computing & IT > Applications of computing > Databases > Data mining Books > Computing & IT > Applications of computing > Databases > Web / Internet databases Promotions
LSN:	1-107-07723-0
Barcode:	9781107077232

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!