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.Read more
- Contains brand new material on deep learning, decision trees, and mining social-network graphs
- Includes a range of more than 250 exercises to challenge even the most able student
- Slides, homework assignments, project requirements, and exams are available from www.mmds.org
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Edition: 3rd Edition
- Date Published: February 2020
- format: Hardback
- isbn: 9781108476348
- dimensions: 253 x 178 x 28 mm
- weight: 1.24kg
- contains: 76 b/w illus. 250 exercises
- availability: In stock
Table of Contents
1. Data mining
2. MapReduce and the new software stack
3. Finding similar items
4. Mining data streams
5. Link analysis
6. Frequent itemsets
8. Advertising on the web
9. Recommendation systems
10. Mining social-network graphs
11. Dimensionality reduction
12. Large-scale machine learning
13. Neural nets and deep learning
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact email@example.com.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×