Mining of Massive Datasets - Anand Rajaraman, Jure Leskovec, Jeffrey
Cuốn sách này tập trung vào khai phá dữ liệu lớn, bao gồm các thuật toán phân tán, tìm kiếm tương tự, xử lý luồng dữ liệu, công nghệ tìm kiếm, khai phá tập phổ biến, phân cụm, quản lý quảng cáo, hệ thống gợi ý, phân tích đồ thị lớn, giảm chiều dữ liệu và các thuật toán học máy cho dữ liệu lớn.
Vorschau wird generiert...
Mining of Massive Datasets Jure Leskovec Stanford Univ. Anand Rajaraman Milliway Labs Jeffrey D. Ullman Stanford Univ. Copyright c 2010, 2011, 2012, 2013, 2014 Anand Rajaraman, Jure Leskovec, and Jeffrey D. Ullman ii Preface This book evolved from material developed over several years by Anand Rajaraman and Jeff Ullman for a one-quarter course at Stanford. The course CS345A, titled “Web Mining,” was designed as an advanced graduate course, although it has become accessible and interesting to advanced undergraduates. When Jure Leskovec joined the Stanford faculty, we reorganized the material considerably. He introduced a new course CS224W on network analysis and added material to CS345A, which was renumbered CS246. The three authors also introduced a large-scale data-mining project course, CS341. The book now contains material taught in all three courses. What the Book Is About At the highest level of description, this book is about data mining. However, it focuses on data mining of very large amounts of data, that is, data so large it does not fit in main memory. Because of the emphasis on size, many of our examples are about the Web or data derived from the Web. Further, the book takes an algorithmic point of view: data mining is about applying algorithms to data, rather than using data to “train” a machine-learning engine of some sort. The principal topics covered are: 1. Distributed file systems and map-reduce as a tool for creating parallel algorithms that succeed on very large amounts of data. 2. Similarity search, including the key techniques of minhashing and localitysensitive hashing. 3. Data-stream processing and specialized algorithms for dealing with data that arrives so fast it must be processed immediately or lost. 4. The technology of search engines, including Google’s PageRank, link-spam detection, and the hubs-and-authorities approach. 5. Frequent-itemset mining, including association rules, market-baskets, the A-Priori Algorithm and its impr
… Laden Sie die Originaldatei herunter, um das vollständige Dokument zu lesen.
- Dokumentenname
- Mining of Massive Datasets - Anand Rajaraman, Jure Leskovec, Jeffrey
- Autor (im Dokument)
- Anand Rajaraman, Jure Leskovec, Jeffrey D. Ullman
- Inhalt
- Đây là một cuốn sách về khai thác dữ liệu lớn, tập trung vào các thuật toán xử lý dữ liệu không vừa bộ nhớ chính. Sách bao gồm các chủ đề từ hệ thống phân tán, tìm kiếm tương tự, xử lý luồng, công cụ tìm kiếm, đến phân cụm, đồ thị lớn và học máy cho dữ liệu quy mô lớn.
- Inhaltsverzeichnis
- 2 MapReduce and the New Software Stack
- 2.1 Distributed File Systems
- 2.1.1 Physical Organization of Compute Nodes
- 2.1.2 Large-Scale File-System Organization
- 2.2 MapReduce
- 2.2.1 The Map Tasks
- 2.2.2 Grouping by Key
- 2.2.3 The Reduce Tasks
- 2.2.4 Combiners
- Seiten
- 513 Seiten
- Hochgeladen von
- Giang Le
Häufig gestellte Fragen
Ist dieses Dokument kostenlos?
Ja. „Mining of Massive Datasets - Anand Rajaraman, Jure Leskovec, Jeffrey“ ist kostenlos — melden Sie sich einfach an und klicken Sie auf Herunterladen, um die Originaldatei zu erhalten.
Wie viele Seiten hat dieses Dokument?
Das Dokument hat 513 Seiten. Sie können es vor dem Herunterladen online in der Vorschau ansehen.
Kann ich vor dem Herunterladen eine Vorschau ansehen?
Ja. Sie können sich dieses Dokument direkt auf dieser Seite im Online-Reader ansehen und dann entscheiden, ob Sie es herunterladen möchten.

Kommentare (0)
Noch keine Kommentare. Seien Sie der Erste!