Mining of Massive Datasets

Jure Leskovec, Anand Rajaraman, Jeffrey David Ullman

• Publisher: Cambridge University Press
• Year: 2014
• Print ISBN: 9781107077232
• eBook ISBN: 9781316147313
• Edition: 2
• Topic: Informatica
• Subtopic: Database

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.

Table of contents

• Cover
• Half-title
• Title page
• Copyright information
• Table of Contents
• Preface
• 1 Data Mining
• 2 MapReduce and the New Software Stack
• 3 Finding Similar Items
• 4 Mining Data Streams
• 5 Link Analysis
• 6 Frequent Itemsets
• 7 Clustering
• 8 Advertising on the Web
• 9 Recommendation Systems
• 10 Mining Social-Network Graphs
• 11 Dimensionality Reduction
• 12 Large-Scale Machine Learning
• Index