Mining of Massive Datasets
-
By Anand Rajaraman
WalmartLabs
By Jeffrey David Ullman
-
Publisher: Cambridge University Press
Print Publication Year:2011
Online Publication Date:June 2012
Online ISBN:9781139058452
Hardback ISBN:9781107015357
-
Book DOI: http://dx.doi.org/10.1017/CBO9781139058452
Subjects: Knowledge Management, Databases and Data Mining , Computational statistics, machine learning and information science
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 which can be used on 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. The PageRank idea and related tricks for organizing the Web are covered next. Other chapters cover the problems of finding frequent itemsets and clustering. The final chapters cover two applications: recommendation systems and Web advertising, each vital in e-commerce. Written by two authorities in database and Web technologies, this book is essential reading for students and practitioners alike.
-
pp. i-iv
-
pp. v-viii
-
pp. ix-x
-
pp. 1-17
-
2 - Large-Scale File Systems and Map-Reduce: Read PDF
pp. 18-52
-
3 - Finding Similar Items: Read PDF
pp. 53-107
-
4 - Mining Data Streams: Read PDF
pp. 108-138
-
pp. 139-175
-
6 - Frequent Itemsets: Read PDF
pp. 176-212
-
pp. 213-251
-
8 - Advertising on the Web: Read PDF
pp. 252-276
-
9 - Recommendation Systems: Read PDF
pp. 277-309
-
pp. 310-315



