01789nam a22002177a 450000500170000000800410001702200180005802801170007608200160019310000580020924500490026725000160031626000540033230000280038636500080041450503020042252007620072465000210148665500260150770000380153320180917152913.0180917b xxu||||| |||| 00| 0 eng d a9781316638491 aAtlantic Publishers & Distributors (P)LTD.b;7/22,Anasri Road, Daryaganj,New Delhi-110002c;1082225d;05/09/2018 a006.312 LES aJurij Leskoveca; Anand Rajaramana; Jeffrey D Ullman aMining of massive datasets.c/Jurij Leskovec a2nd edition aCambridge b: Cambridge University Pressc, 2014. axii, 467 pagesc;24 cm. b649 a Data mining -- MapReduce and the new software stack -- Finding similar items -- Mining data streams -- Link analysis -- Frequent itemsets -- Clustering -- Advertising on the Web -- Recommendation systems -- Mining social-network graphs -- Dimensionality reduction -- Large-scale machine learning. a 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. It includes a range of over 150 challenging exercises. aComputer Science aData miningbBig data aAnand Rajaraman; Jeffrey D Ullman