Mining of Massive Datasets

Leskovec, Jure, Rajaraman, Anand, Ullman, Jeffrey David

  • 出版商: Cambridge
  • 出版日期: 2020-01-09
  • 售價: $2,905
  • 貴賓價: 9.5$2,760
  • 語言: 英文
  • 頁數: 565
  • 裝訂: Hardcover - also called cloth, retail trade, or trade
  • ISBN: 1108476341
  • ISBN-13: 9781108476348

下單後立即進貨 (約1週~2週)


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 MapReduce 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 third edition includes new and extended coverage on decision trees, deep learning, and mining social-network graphs.