建國科技大學圖書館 |

語系: 繁體中文

說明(常見問題)

圖書館個人資料蒐集告知聲明

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Mining of massive datasets

Leskovec, Jurij.

Mining of massive datasets

紀錄類型:	書目-語言資料,印刷品 : 單行本
作者:	LeskovecJurij.,
其他作者:	RajaramanAnand.,
其他作者:	UllmanJeffrey D., 1942-
出版地:	Cambridge, United Kingdom
出版者:	Cambridge University Press;
出版年:	c2020.
版本:	3rd ed.
面頁冊數:	xi, 553 p.ill. : 26 cm.;
標題:	Data mining. -
附註:	Previous ed. in 2014.
摘要註:	"The Web, social media, mobile activity, sensors, Internet commerce, and many other modern applications provide 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 used on even the largest datasets. It begins with a discussion of the MapReduce framework and related techniques for efficient parallel programming. The tricks of locality-sensitive hashing are explained. This body of knowledge, which deserves to be more widely known, is essential when seeking similar objects in a very large collection without having to compare each pair of objects. Stream-processing algorithms for mining data that arrives too fast for exhaustive processing are also explained. The PageRank idea and related tricks for organizing the Web are covered next. Other chapters cover the problems of finding frequent itemsets and clustering, each from the point of view that the data is too large to fit in main memory. Two applications: recommendation systems and Web advertising, each vital in e-commerce, are treated in detail. Later chapters cover algorithms for analyzing social-network graphs, compressing large-scale data, and machine learning. This third edition includes new and extended coverage on decision trees, deep learning, and mining social-network graphs. Written by leading authorities in database and Web technologies, it is essential reading for students and practitioners alike"--Provided by publisher.
ISBN:	9781108476348
內容註:	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 Neural nets and deep learning.

Mining of massive datasets
Leskovec, Jurij.

Mining of massive datasets / Jure Leskovec, Anand Rajaraman, Jeffrey David Ullman. - 3rd ed.. - Cambridge, United Kingdom : Cambridge University Press, c2020.. - xi, 553 p. ; ill. ; 26 cm..
Data mining.
Previous ed. in 2014..
Includes bibliographical references and index..
ISBN 9781108476348ISBN 1108476341
Data mining.

Rajaraman, Anand.

Mining of massive datasets
LDR:02543cam a2200229 450 001 393587
010 1 $a 9781108476348 $b hbk. $d NT1650
010 1 $a 1108476341 $b hbk.
100 $a 20210910d2020 k y0engy50 b
101 0 $a eng
102 $a gb
105 $a a a 001yy
200 1 $a Mining of massive datasets $f Jure Leskovec, Anand Rajaraman, Jeffrey David Ullman.
205 $a 3rd ed.
210 $a Cambridge, United Kingdom $a New York, USA $c Cambridge University Press $d c2020.
215 1 $a xi, 553 p. $c ill. $d 26 cm.
300 $a Previous ed. in 2014.
320 $a Includes bibliographical references and index.
327 1 $a Data mining $a MapReduce and the new software stack $a Finding similar items $a Mining data streams $a Link analysis $a Frequent itemsets $a Clustering $a Advertising on the Web $a Recommendation systems $a Mining social-network graphs $a Dimensionality reduction $a Large-scale machine learning $a Neural nets and deep learning.
330 $a "The Web, social media, mobile activity, sensors, Internet commerce, and many other modern applications provide 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 used on even the largest datasets. It begins with a discussion of the MapReduce framework and related techniques for efficient parallel programming. The tricks of locality-sensitive hashing are explained. This body of knowledge, which deserves to be more widely known, is essential when seeking similar objects in a very large collection without having to compare each pair of objects. Stream-processing algorithms for mining data that arrives too fast for exhaustive processing are also explained. The PageRank idea and related tricks for organizing the Web are covered next. Other chapters cover the problems of finding frequent itemsets and clustering, each from the point of view that the data is too large to fit in main memory. Two applications: recommendation systems and Web advertising, each vital in e-commerce, are treated in detail. Later chapters cover algorithms for analyzing social-network graphs, compressing large-scale data, and machine learning. This third edition includes new and extended coverage on decision trees, deep learning, and mining social-network graphs. Written by leading authorities in database and Web technologies, it is essential reading for students and practitioners alike"--Provided by publisher.
606 $a Data mining. $2 lc $3 38424
676 $a 006.312 $v 23
680 $a HF5415.125 $b .L46 2020
700 1 $a Leskovec $b Jurij. $3 385468
702 1 $a Rajaraman $b Anand. $3 385469
702 1 $a Ullman $b Jeffrey D. $f 1942- $3 123947
801 0 $a cw $b CTU $c 20210910 $g AACR2