Suppose that you are developing a data mining algorithm that stores 4GB input dataset in an array. After removing the unnecessary attributes and outliers in the preprocessing stage, the size of the dataset becomes 2GB, which is also stored in an array. The size of the final results from the mining algorithm could be 3GB and should be stored in another array. However, the size of heap is 7GB, which is not enough to store the final results since the input and preprocessed dataset have already occupied 4GB+2GB. Find a solution to accommodate all results of the mining algorithm without increasing the heap size.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Plese solve this following question of the concept of arrays in Java program. Please answer this as soon as possible. Thank you in advance. 

Suppose that you are developing a data mining algorithm that stores 4GB
input dataset in an array. After removing the unnecessary attributes and
outliers in the preprocessing stage, the size of the dataset becomes 2GB,
which is also stored in an array. The size of the final results from the mining
algorithm could be 3GB and should be stored in another array. However, the
size of heap is 7GB, which is not enough to store the final results since the
input and preprocessed dataset have already occupied 4GB+2GB. Find a
solution to accommodate all results of the mining algorithm without
increasing the heap size.
Transcribed Image Text:Suppose that you are developing a data mining algorithm that stores 4GB input dataset in an array. After removing the unnecessary attributes and outliers in the preprocessing stage, the size of the dataset becomes 2GB, which is also stored in an array. The size of the final results from the mining algorithm could be 3GB and should be stored in another array. However, the size of heap is 7GB, which is not enough to store the final results since the input and preprocessed dataset have already occupied 4GB+2GB. Find a solution to accommodate all results of the mining algorithm without increasing the heap size.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY