Skip to main content Skip to search
HKSYU Library

    Librarian View

    LEADER 03189cam a2200397 i 4500
    001
    991008210869207546
    005
    20241023153014.0
    008
    200323s2020 nyua b 001 0 eng d
    010
     
     
    a| 2020012035
    020
     
     
    a| 9781108476348 q| (hardback)
    020
     
     
    a| 1108476341 q| (hardback)
    035
     
     
    a| (OCoLC)1119525252
    035
     
     
    a| (OCoLC)on1119525252
    040
     
     
    a| DLC b| eng e| rda c| DLC d| YDXIT d| YDX d| OCLCO d| CHVBK d| HNK d| HK-SYU
    042
     
     
    a| pcc
    050
    0
    0
    a| HF5415.125 b| .L46 2020
    082
    0
    4
    a| 006.312 2| 23
    092
    0
     
    a| 006.312 b| LES 2020
    100
    1
     
    a| Leskovec, Jurij, e| author.
    245
    1
    0
    a| Mining of massive datasets / c| Jure Leskovec, Anand Rajaraman, Jeffrey David Ullman.
    250
     
     
    a| Third edition.
    264
     
    1
    a| New York, NY : b| Cambridge University Press, c| 2020.
    264
     
    4
    c| ©2020
    300
     
     
    a| xi, 553 pages : b| illustrations ; c| 26 cm
    336
     
     
    a| text b| txt 2| rdacontent
    337
     
     
    a| unmediated b| n 2| rdamedia
    338
     
     
    a| volume b| nc 2| rdacarrier
    520
     
     
    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"-- c| Provided by publisher.
    504
     
     
    a| Includes bibliographical references and index.
    505
    0
     
    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 -- Neural nets and deep learning.
    650
     
    0
    a| Data mining.
    700
    1
     
    a| Rajaraman, Anand, e| author.
    700
    1
     
    a| Ullman, Jeffrey D., d| 1942- e| author.
    910
     
     
    b| kkl c| wsl
    998
     
     
    a| book b| 23-10-24
    945
     
     
    h| Supplement l| location i| barcode y| id f| bookplate a| callnoa b| callnob n| FINT300