Mining of Massive Datasets读书介绍
| 类别 | 页数 | 译者 | 网友评分 | 年代 | 出版社 |
|---|---|---|---|---|---|
| 书籍 | 476页 | 8.9 | 2020 | Cambridge University Press |
| 定价 | 出版日期 | 最近访问 | 访问指数 |
|---|---|---|---|
| USD 75.99 | 2020-02-20 … | 2020-03-08 … | 47 |
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.
作者简介Jure Leskovec is Assistant Professor of Computer Science at Stanford University. His research focuses on mining large social and information networks. Problems he investigates are motivated by large scale data, the Web and on-line media. This research has won several awards including a Microsoft Research Faculty Fellowship, the Alfred P. Sloan Fellowship, Okawa Foundation Fello...
剧情呢，免费看分享剧情、挑选影视作品、精选好书简介分享。