Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Java Data Analysis

You're reading from   Java Data Analysis Data mining, big data analysis, NoSQL, and data visualization

Arrow left icon
Product type Paperback
Published in Sep 2017
Publisher Packt
ISBN-13 9781787285651
Length 412 pages
Edition 1st Edition
Languages
Concepts
Arrow right icon
Author (1):
Arrow left icon
John R. Hubbard John R. Hubbard
Author Profile Icon John R. Hubbard
John R. Hubbard
Arrow right icon
View More author details
Toc

Table of Contents (14) Chapters Close

Preface 1. Introduction to Data Analysis 2. Data Preprocessing FREE CHAPTER 3. Data Visualization 4. Statistics 5. Relational Databases 6. Regression Analysis 7. Classification Analysis 8. Cluster Analysis 9. Recommender Systems 10. NoSQL Databases 11. Big Data Analysis with Java A. Java Tools Index

Some examples of MapReduce applications


Here are a few examples of big data problems that can be solved with the MapReduce framework:

  1. Given a repository of text files, find the frequency of each word. This is called the WordCount problem.

  2. Given a repository of text files, find the number of words of each word length.

  3. Given two matrices in sparse matrix format, compute their product.

  4. Factor a matrix given in sparse matrix format.

  5. Given a symmetric graph whose nodes represent people and edges represent friendship, compile a list of common friends.

  6. Given a symmetric graph whose nodes represent people and edges represent friendship, compute the average number of friends by age.

  7. Given a repository of weather records, find the annual global minima and maxima by year.

  8. Sort a large list. Note that in most implementations of the MapReduce framework, this problem is trivial, because the framework automatically sorts the output from the map() function.

  9. Reverse a graph.

  10. Find a minimal spanning tree (MST) of a...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime