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 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.
看有同学说是 stanford的入门课程,按理说应该不是太难。作为初学者来说,本书翻译的实在不敢恭维,看了50多页是一头雾水,很多话实在是晦涩难懂。本书作用入门级课程来说,基本上涵盖了数据挖掘的各个大类,如果想细致研究某个领域的大拿就不用看了
評分我真的不能忍受一帮子没读过此书,没写过代码,没搞过大数据的外行人在这边乱喷这本书。对豆瓣这本书的评价实在是太失望了。 这是我读到的第一本真正讲“大数据”思路的书。 面对海量数据的时候,我们的软件架构也会跟着发生变化。当你的数据量在内存里放不下的时候,你就得考...
評分只看了两章,所有真心不好打分。这其实是本数学书,而且是一本入门书。这本书的目标读者不是工程师,而是读研或者读博的学生。如果你本身就有数据挖掘后者机器学习的背景,或者就是很喜欢数学,我还是很推荐这本书的,学习新东西总是很有趣的。
評分很差是给中译版的。 本书的中译版是中科院计算所的王斌老师翻译的,但是翻译的很屎。估计王老师拿到英文稿之后就扔给学生去翻译了,看这翻译水平,实在是不敢恭维。 以上纯为发泄心中不满所写。因为我看译者序,说是自己独立翻译,前后持续了七个多月,并历经多次修改。如果...
評分读技术书于我而言就像高中物理老师说的那样:一看就懂、一说就糊、一写就错。为了不马上遗忘昨天刚刚看完的这本书,决定写点东西以帮助多少年之后还有那么一点点记忆。好吧,开写。 1. 总体来说,数据挖掘时数据模型的发现过程。而数据建模的方法可以归纳为两种:数...
bug非常之多, 還找不到地方提交, 讀起來極度痛苦, 前看後忘, 也許裏麵的算法本質上就是這樣, bottom line至少近15年最新的論文成果被這麼串講一下, 本科生也能看懂
评分下學期課程參考textbook,聽說professor還不錯,打算好好學一下這門課
评分行文很流暢,看到下麵很多人說翻譯的問題,由此推薦原版。配閤網課還是挺淺顯的,例子舉得也挺多,自學也可以。步驟寫的也很細,有條件完全可以照著碼,不晦澀,小白很喜歡。
评分行文很流暢,看到下麵很多人說翻譯的問題,由此推薦原版。配閤網課還是挺淺顯的,例子舉得也挺多,自學也可以。步驟寫的也很細,有條件完全可以照著碼,不晦澀,小白很喜歡。
评分bug非常之多, 還找不到地方提交, 讀起來極度痛苦, 前看後忘, 也許裏麵的算法本質上就是這樣, bottom line至少近15年最新的論文成果被這麼串講一下, 本科生也能看懂
本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度,google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美書屋 版权所有