Search Books
Network Science Workload Modeling for Compu…

Mining of Massive Datasets

Author Jure Leskovec, Anand Rajaraman, Jeffrey David Ullman
Publisher Cambridge University Press
Category Computers
📄 Viewing lite version Full site ›
🌎 Shop on Amazon — choose country
58.68 72.00 USD
🛒 Buy New on Amazon 🇺🇸 🏷 Buy Used — $45.00

✓ Usually ships in 24 hours

Share:
Book Details
ISBN / ASIN1107077230
ISBN-139781107077232
AvailabilityUsually ships in 24 hours
Sales Rank142,649
CategoryComputers
MarketplaceUnited States 🇺🇸

Description

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.
The Good Web Site Guide 2006: The Completely Revised, …
View
The Pentium Microprocessor
View
Advanced Intel Microprocessors: 80286, 80386, And 80486
View
Differential Equations: Matrices and Models
View
Digital Experiments: Emphasizing Troubleshooting (Merr…
View
Data Structures for Computer Information Systems
View
The Little LISPer, Third Edition
View
Inside Networks
View
Computer Graphics Using Open GL (2nd Edition)
View