Abstract
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 which can be used on 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. The PageRank idea and related tricks for organizing the Web are covered next. Other chapters cover the problems of finding frequent itemsets and…
Citation impact
2,297
total citations
- FWCI
- 37.06
- Percentile
- 100%
- References
- 104
Citations per year
Authors
2Topics & keywords
Topics
Keywords
- Computer science
- Cluster analysis
- Web mining
- Locality-sensitive hashing
- Data science
- PageRank
- Data mining
- Key (lock)
No related works found for this paper.