Image from Google Jackets

Mining of Massive Datasets / by J. Leskovec and others. [Electronic Resource]

By: Material type: Computer fileComputer filePublication details: Cambridge : Cambridge University Press, 2014Edition: 2nd EdDescription: xii, 467pISBN:
  • 9781139924801
Related works:
  • Rajaraman, A. [Author]
  • Ullman, J. [Author]
Subject(s): DDC classification:
  • 006.312 L563M
Online resources: Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Home library Collection Call number Status Notes Date due Barcode Item holds
e-Book e-Book S. R. Ranganathan Learning Hub Online Textbook 006.312 L563M (Browse shelf(Opens below)) Available (e-Book For Access) Platform : Cambridge Core EB0364
Total holds: 0

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.

There are no comments on this title.

to post a comment.