Mining of Massive Datasets pdf epub mobi txt 電子書 下載2025
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 Fellowship, and numerous best paper awards. His research has also been featured in popular press outlets such as the New York Times, the Wall Street Journal, the Washington Post, MIT Technology Review, NBC, BBC, CBC and Wired. Leskovec has also authored the Stanford Network Analysis Platform (SNAP, http://snap.stanford.edu), a general purpose network analysis and graph mining library that easily scales to massive networks with hundreds of millions of nodes and billions of edges. You can follow him on Twitter at @jure.
- 數據挖掘
- 計算機
- 機器學習
- Data
- Coursera
- CS
- 數據分析
- 軟件工程
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.
具體描述
讀後感
从总体安排来看，书的结构还是不错的。没看过英文的，但是中文版的行文真的不好，磕磕绊绊看了一半以后实在是没有兴趣看后面的了。 之前了解的pagerank看了以后了解了，之前不了解的adwords还是不了解，
評分终于看完了这本书，读的比较粗，但是还是发现了很多的小错误，不知道是作者的错误还是译者的错误，总之给人不严谨不严肃的印象，知识还是比较容易理解的（虽然本人没记住多少。。汗。。），还是积累了不错的知识，天道酬勤！
評分 評分看到好多人说这本书是大纲，是目录，没啥内容，讲的浅。 那就对了。 本书是Stanford CS246课程MMDS使用的讲义，还有配套的Slides和HW，所以观看本书请配套课程进行学习，同时coursera上也有配套的课程。 See more detail: http://www.mmds.org/
評分读技术书于我而言就像高中物理老师说的那样：一看就懂、一说就糊、一写就错。为了不马上遗忘昨天刚刚看完的这本书，决定写点东西以帮助多少年之后还有那么一点点记忆。好吧，开写。 1. 总体来说，数据挖掘时数据模型的发现过程。而数据建模的方法可以归纳为两种：数...
用戶評價
bug非常之多, 還找不到地方提交, 讀起來極度痛苦, 前看後忘, 也許裏麵的算法本質上就是這樣, bottom line至少近15年最新的論文成果被這麼串講一下, 本科生也能看懂
评分勉強一刷吧。到時配閤斯坦福的課再過一遍~
评分勉強一刷吧。到時配閤斯坦福的課再過一遍~
评分勉強一刷吧。到時配閤斯坦福的課再過一遍~
评分花費6個月時間，斷斷續續看完，哈希和近似的想法真是開闊瞭眼界。第一迴看比較急促，此書值得反復看，多實踐。
相關圖書
本站所有內容均為互聯網搜索引擎提供的公開搜索信息，本站不存儲任何數據與內容，任何內容與數據均與本站無關，如有需要請聯繫相關搜索引擎包括但不限於百度，google,bing,sogou 等
© 2025 qciss.net All Rights Reserved. 小哈圖書下載中心 版权所有