Mining of Massive Datasets

Douban
Mining of Massive Datasets

Inscrivez ou connectez-vous pour évaluer cette œuvre ou l'ajouter à votre collection.

ISBN: 9781107077232
écrit par: Jure Leskovec / Anand Rajaraman / Jeffrey David Ullman
édition: Cambridge University Press
date de publication: 2014
reliure: Hardcover
prix: USD 75.99
nombre de pages: 476

/ 10

1 évaluations

Pas assez d'évaluations
Acheter ou emprunter

2nd Edition

Jure Leskovec / Anand Rajaraman   

résumé

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.

autres éditions
commentaires
avis
笔记