Mining of massive datasets
Jurij Leskovec (Author), Anand Rajaraman (Author), Jeffrey D. Ullman (Author)
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. It includes a range of over 150 challenging exercises. -- Edited sumamry from book
eBook, English, 2014
Cambridge University Press, Cambridge, 2014