Mining of Massive Datasets, 2/e (Hardcover)

Jure Leskovec, Anand Rajaraman, Jeffrey David Ullman

  • 出版商: Cambridge University Press
  • 出版日期: 2014-12-29
  • 售價: $2,500
  • 貴賓價: 9.5$2,375
  • 語言: 英文
  • 頁數: 476
  • 裝訂: Hardcover
  • ISBN: 1107077230
  • ISBN-13: 9781107077232

立即出貨 (庫存 < 4)

買這商品的人也買了...

相關主題

商品描述

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.