Mining of massive datasets / (Record no. 19335)

MARC details
000 -LEADER
fixed length control field 02377cam a22002418i 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250421080607.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250213s2020 nyua b 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781108476348 (hardback)
037 ## - SOURCE OF ACQUISITION
Source of stock number/acquisition SBF2024
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Language of cataloging eng
Transcribing agency DLC
Modifying agency AE-ShU
Transcribing agency UKB
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number HF5415.125
Item number .L46 2020
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Leskovec, Jurij,
Relator term author.
245 10 - TITLE STATEMENT
Title Mining of massive datasets /
Statement of responsibility, etc. Jure Leskovec, Stanford University, Anand Rajaraman, Rocketship VC, Jeffrey David Ullman, Stanford University.
250 ## - EDITION STATEMENT
Edition statement Third edition.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. New York, NY :
Name of publisher, distributor, etc. Cambridge University Press,
Date of publication, distribution, etc. 2020.
300 ## - PHYSICAL DESCRIPTION
Extent xi, 553 pages :
Other physical details illustrations ;
Dimensions 26 cm
500 ## - GENERAL NOTE
General note Includes index.
520 ## - SUMMARY, ETC.
Summary, etc. "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"--
Assigning source Provided by publisher.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Data mining.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Rajaraman, Anand,
Relator term author.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ullman, Jeffrey D.,
Dates associated with a name 1942-
Relator term author.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Inventory number Total checkouts Full call number Barcode Date last seen Price effective from Koha item type
        Loanable University of Kalba University of Kalba 2013-02-25 SBF2024 i15737688   HF5415.125 .L46 2020 00-1-384097 2025-04-21 2025-04-21 Books

© 2025 University of Kalba. All Rights Reserved.