ID Major Avg. project score Avg. exam score Employed? Salary Computer 82 76 Yes 90,000 Engineering 84 94 Yes 75,000 3. Engineering 73 65 No Math 71 No Computer 92 75 Yes 95,000 For each of the following tasks, describe (briefly) what, if anything, you would need to do to the above dataset before using any learning algorithm to predict if someone will be employed following graduation. a) Data cleaning b) Data integration c) Data transformation d) Data reduction e) Data discretization

ID Major Avg. project score Avg. exam score Employed? Salary Computer 82 76 Yes 90,000 Engineering 84 94 Yes 75,000 3. Engineering 73 65 No Math 71 No Computer 92 75 Yes 95,000 For each of the following tasks, describe (briefly) what, if anything, you would need to do to the above dataset before using any learning algorithm to predict if someone will be employed following graduation. a) Data cleaning b) Data integration c) Data transformation d) Data reduction e) Data discretization

Fundamentals of Information Systems

8th Edition

ISBN:9781305082168

Author:Ralph Stair, George Reynolds

Publisher:Ralph Stair, George Reynolds

Chapter8: Systems Development

Section: Chapter Questions

Problem 2.2DQ

See similar textbooks

Computer Science

please help i only have 15 min

Problem 1:
Major
Avg. project score
Avg. exam score
Employed?
Salary
ID
Computer
82
76
Yes
90,000
Engineering
84
94
Yes
75,000
3
Engineering
73
65
No
Math
71
No
Computer
92
75
Yes
95,000
For each of the following tasks, describe (briefly) what, if anything, you would need to do to the above
dataset before using any learning algorithm to predict if someone will be employed following
graduation.
a) Data cleaning
b) Data integration
c) Data transformation
d) Data reduction
e) Data discretization

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider the following task of building a zoo for Drexel! You've gathered m donors to fund the creation ofyour new park, and you've picked the location, so now you just need to choose the inhabitants. Ideally you'dget every animal imaginable, except you just don't have space. As it is, you have room to comfortably tk animals. Since you'd like to ensure that your funding doesn't dry up, you gure your donors should getto make requests about which animals will be kept. After sending out a few emails, you collect from eachdonor i a list of animals Ai which donor i would like to have at the zoo. As you suspected, the total numberof di erent animals appearing on the m lists exceeds k, so you won't be able to satisfy all of their requests.You decide the fairest thing to do is to ensure that at least 1 animal from each Ai is chosen.Given all these lists, we want to know whether we can select a set H of at most k animals to put in thezoo such that each donor i will be able to see at least one…
Correct answer will be upvoted else downvoted. Computer science. You are permitted to alter the marks through the accompanying activity: Pick two particular integers I and j among 1 and n. Trade the marks of focuses I and j, lastly Draw the section between focuses I and j. A grouping of tasks is legitimate if in the wake of applying every one of the activities in the succession all together, the k-th point winds up having the name k for all k among 1 and n comprehensive, and the drawn sections don't meet each other inside. Officially, assuming two of the portions cross, they should do as such at a typical endpoint of the two sections. Specifically, all drawn portions should be unmistakable. Track down any legitimate arrangement of activities, or say that none exist. Input The main line contains an integer n (3≤n≤2000) — the number of focuses. The I-th of the accompanying n lines contains three integers xi, yi, man-made intelligence (−106≤xi,yi≤106,…
Which of the following examples features a child effectively using hot executive function? In the DCCS, Julian correctly switches from sorting by shape to sorting by color. During the delayed gratification task, Julian rings the bell because he is tired of waiting. Julian solves the Tower of Hanoi problem in the fewest possible moves because he constructed a well-defined problem space. Julian says the color of the ink in the Stroop task, because those are the rules of the task. At home, Julian suppresses his urge to take cookies from the family cookie jar because every time he did that in the past, he was put in time-out.
Consider the following task of building a zoo for Drexel! You’ve gathered m donors to fund the creation ofyour new park, and you’ve picked the location, so now you just need to choose the inhabitants. Ideally you’dget every animal imaginable, except you just don’t have space. As it is, you have room to comfortably fitk animals. Since you’d like to ensure that your funding doesn’t dry up, you figure your donors should getto make requests about which animals will be kept. After sending out a few emails, you collect from eachdonor i a list of animals Ai which donor i would like to have at the zoo. As you suspected, the total numberof different animals appearing on the m lists exceeds k, so you won’t be able to satisfy all of their requests.You decide the fairest thing to do is to ensure that at least 1 animal from each Aiis chosen.Given all these lists, we want to know whether we can select a set H of at most k animals to put in thezoo such that each donor i will be able to see at least…
Correct answer will be upvoted else downvoted. There are n focuses on an endless plane. The I-th point has facilitates (xi,yi) to such an extent that xi>0 and yi>0. The directions are not really integer. In one maneuver you play out the accompanying activities: pick two focuses an and b (a≠b); move point a from (xa,ya) to either (xa+1,ya) or (xa,ya+1); move point b from (xb,yb) to either (xb+1,yb) or (xb,yb+1); eliminate focuses an and b. Notwithstanding, the move must be performed if there exists a line that goes through the new organizes of, another directions of b and (0,0). If not, the move can't be performed and the focuses stay at their unique directions (xa,ya) and (xb,yb), individually. Input The main line contains a solitary integer n (1≤n≤2⋅105) — the number of focuses. The I-th of the following n lines contains four integers ai,bi,ci,di (1≤ai,bi,ci,di≤109). The directions of the I-th point are xi=aibi and yi=cidi. Output :In the primary…
The use of computers in education is referred to as computer-assisted instruction (CAI). One problem that develops in CAI environments is student fatigue. This problem can be eliminated by varying the computer's dialogue to hold the student's attention. For each correct answer and each incorrect an- swer. The set of responses for correct answers is as follows: Very good! Excellent! Nice work! Keep up the good work! The set of responses for incorrect answers is as follows: No. Please try again. Wrong. Try once more. Don't give up!No. Keep trying. Use random number generation to choose a number from 1 to 4 that will be used to select an appropriate response to each answer. Use a switch statement to issue the responses. Please write the code in Javascript HTML5
Consider the Modified tower of Hanoi problem with 2 Pegs (A, B) and 10 Disks. All these disks are placed in Peg A, where the smallest disk is placed on the top and the largest disk is placed on the bottom. We want to move all these disks from A to B.What is the minimum number of moves required to solve this problem. While moving, consider the same rule as shown in the class. Justify your answer.
Which of the following can complete the statement below?Different algorithms for the same problem can... never come up with exactly the same outcome can not be generated as algorithms require very specific information have different running times solve the problem differently please tell me the answers
Question 9 Full explainthe this question very fast solution sent me step by step Don't ignore any part all part work u A and bText typing work only not allow paper work
You have decided to undertake a project and have defined the main research question as ‘What are theopinions of consumers on a 10 percent reduction in weight, with the price remaining the same, of “Snackers”chocolate bars?’Write both a null and alternative hypothesis that you could test in your project. In your response, also definethe purpose of the study, define the research problem statement, list the research objectives, and researchquestions.
Correct answer will be upvoted else Multiple Downvoted. Computer science. Berland local ICPC challenge has quite recently finished. There were m members numbered from 1 to m, who contended on a problemset of n issues numbered from 1 to n. Presently the article is going to happen. There are two issue creators, every one of them will tell the instructional exercise to precisely k back to back errands of the problemset. The creators pick the section of k continuous errands for themselves autonomously of one another. The sections can correspond, meet or not cross by any means. The I-th member is keen on paying attention to the instructional exercise of all continuous errands from li to ri. Every member consistently decides to pay attention to just the issue creator that tells the instructional exercises to the most extreme number of assignments he is keen on. Leave this greatest number alone artificial intelligence. No member can pay attention to both of the creators, regardless of…
Which of the following statements about supervised learning is not accurate? * a) It is a form of machine learning known as reinforcement learning b) It doesn't need any response variable at all c) Classification, a kind of supervised learning that falls under this category d) None of the preceding options