Mining of Massive Datasets

豆瓣
Mining of Massive Datasets

登入後可管理標記收藏

ISBN: 9781107077232
作者: Jure Leskovec / Anand Rajaraman / Jeffrey David Ullman
出版社: Cambridge University Press
發行時間: 2014
裝訂: Hardcover
價格: USD 75.99
頁數: 476

/ 10

1 個評分

評分人數不足
借閱或購買

2nd Edition

Jure Leskovec / Anand Rajaraman   

簡介

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.

其它版本
短評
評論
笔记