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 item sets and clustering. The final chapters cover two applications: recommendation systems and web advertising, each vital in e-commerce. Written by two authorities in database and web technologies, this book is essential reading for students and practitioners alike.table of contents data mining large-scale file systems and map-reduce finding similar items mining data streams link analysis frequent itemsets clustering advertising on the web recommendation systems
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.