Note: please send me solutionproblems 3&4 normal solutionnot in program or outputProblem 3Suppose we have area and number of bedrooms and its corresponding fordifferent houses sold in Montreal. Now suppose john want to buy a househaving an area of 2000 feet2 with 2 bedrooms. Your task is to predict the priceof this house using KNN algorithm with K=3 and Euclidian distance formula.Living area (feet')# bedroomsHouse Price$ 400000S 330000S 369000$ 232000$ 5400002104160024003.141630004.Problem 4Use the k-means algorithm and Euclidean distance to cluster the following 9examples into 3 clusters: A1%= (-2,-1), A2=(-2,5), A3=(8,-4), A4=(3,-2),A5=(4,5), A6=(6,4), A7=(-1,2), A8=(4,-9), A9=(5,5). Suppose that the initialseeds (centers of each cluster) are A1, A4 and A7.a. Apply kmeans algorithm to tell finally which points are included in C1,C2 and C3.b. Draw all the 9 points on xy plane and circle each cluster to show itmakes sense or not.

Answered: Image /qna-images/answer/6d1882d6-f716-42a2-81c4-abcb8effca58.jpg

Problem 3 Suppose we have area and number of bedrooms and its corresponding for different houses sold in Montreal. Now suppose john want to buy a house having an area of 2000 feet2 with 2 bedrooms. Your task is to predict the price of this house using KNN algorithm with K=3 and Euclidian distance formula. Living area (feet') 2104 # bedrooms House Price $ 400000 S 330000 S 369000 $ 232000 $ 540000 3 1600 2400 3 1416 3000 4. Problem 4 Use the k-means algorithm and Euclidean distance to cluster the following 9 examples into 3 clusters: A1= (-2,-1), A2=(-2,5), A3=(8,-4), A4=(3,-2), A5=(4,5), A6=(6,4), A7=(-1,2), A8=(4,-9), A9=(5,5). Suppose that the initial seeds (centers of each cluster) are A1, A4 and A7.

Problem 3 Suppose we have area and number of bedrooms and its corresponding for different houses sold in Montreal. Now suppose john want to buy a house having an area of 2000 feet2 with 2 bedrooms. Your task is to predict the price of this house using KNN algorithm with K=3 and Euclidian distance formula. Living area (feet') 2104 # bedrooms House Price $ 400000 S 330000 S 369000 $ 232000 $ 540000 3 1600 2400 3 1416 3000 4. Problem 4 Use the k-means algorithm and Euclidean distance to cluster the following 9 examples into 3 clusters: A1= (-2,-1), A2=(-2,5), A3=(8,-4), A4=(3,-2), A5=(4,5), A6=(6,4), A7=(-1,2), A8=(4,-9), A9=(5,5). Suppose that the initial seeds (centers of each cluster) are A1, A4 and A7.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Show the solution steps pls. Algorithm
We want to buy the car depending on its cost for 10 years. Here is the algorithm for deciding which car to buy dependir a price of OMR 4.000 per liter of gas and usage of 15,000 kilometers per year. For each car, compute the total cost as follows: annual fuel consumed = annual miles driven / fuel efficiency %3D annual fuel cost = price per gallon x annual fuel consumed operating cost = 10 x annual fuel cost total cost = purchase price + operating cost If total cost1 total cost2 Choose car2. Else Choose car1 or car2 Use these sample values: Car 1: purchase price: OMR 25,000, fuel efficiency: 10 kms/liter, Car 2: purchase price: OMR 20,000, fuel efficiency: 15 kms/liter What is the outcome of the algorithm. O a. Choose car 2 O b. Choose car 1 O c. Choose car1 or car2 O d. Choose car1 and car2
Minimize the function given below using imap F(ABC)=€(0,1,3,4,6,8,9,11,12,14)
Given a rod of length n inches and a table of prices p, for I = 1, 2, ., n, use dynamic programming to determine the maximum revenue rn obtainable by cutting up the rod. (10) (fill the table) Length 12345 Price 2479 12 Pi
Write computer codes using any programming language for the two-equation Newton-Raphson method and test it by solving problem. Use multiple equation Newton-Raphson method to determine one of the roots of the following simultaneous nonlinear equations within ɛ, = 0.01%. x² + y? = 16 (x – 4)² + (y – 4)² = 5
Employees of KB and SONS Consultants Limited are paid at an hourly basics of 25GHS per an hour for regular hours and 1.5 times per hour for overtime hours in a week. Any hour worked over 40 hours per week is overtime. The following national tax sliding scale is then applied to determine the amount of tax to be paid by an employee. GrossWage Tax Rate (%) First 125 0 Next 125 5 Next 1500 10 Next 2750 15 Next 1250 20 Excess over 5000 30 In addition 6% of an employee’s gross wage is withheld for Social Security, 3% is withheld as constituency tax and 20GHS is withheld by the employer as welfare contribution. If an employee has more than 3 dependants then an amount of 5GHS for each dependant in excess of three towards NHIS. You are required to write a program that compute a workers gross pay, the deductions and his/her net pay. Your program should allow details of the staff to be accept /input into the system for the necessary computations. Try using comments in explaining the flow of the…
You are given the arrival and departure times of trains reaching to a particular station. You need to find minimum number of platforms required to accommodate the trains at any point of time. Trains arrival = [9:00, 9:40, 9:50, 11:00, 15:00, 18:00] Trains departure = [9:10, 12:00, 11:20, 11:30, 19:00, 20:00] The situation can be solved by using few algorithms. However, it will reflect the complexity of the solution. You are required to solve the problem using, (b) Greedy Algorithm i) Produce the complete algorithm ii) Calculate the minimum number of platforms based on algorithm in (b)(i) and show the process.
For 50 Equally spaced points in the interval of 0 ≤ x ≤ 3, find the value of: 1- f(x) = ex 2- Plot f(x) 3- Find the locations of f(x) ≥2 4- Find the values of f(x) ≥ 2
You are given the arrival and departure times of trains reaching to a particular station. You need to find minimum number of platforms required to accommodate the trains at any point of time. Trains arrival = [9:00, 9:40, 9:50, 11:00, 15:00, 18:00] Trains departure = [9:10, 12:00, 11:20, 11:30, 19:00, 20:00] The situation can be solved by using few algorithms. However, it will reflect the complexity of the solution. You are required to solve the problem using, (a) Brute Force Algorithm i) Produce the complete algorithm ii) Calculate the minimum number of platforms based on algorithm in (a)(i) and show the process.
Randomly generate 15 numbers rounded to 2 decimal places using the Numpy random function “normal()” with a mean of 20 and standard deviation of 5. Use seed of 1. Create a Pandas series of these 15 randomly generated numbers. Suppose that these numbers represent hourly wages of fifteen workers. Use a Pandas functions determine the average wage rate and the corresponding sample standard deviation Use a Boolean mask and Pandas function determine how many workers make less than $15 per hour Use a Boolean mask and Pandas function generate summary descriptive statistics for those earning less than $20 an hour Suppose that 5% raise for all individuals is approved. Create a new Pandas series for the new wage rate rounded to 2 decimal places
Construct a graph to show how the time to complete the 10th car changes as the learning curve slope parameter is varied from 75% to 95%. The Mechanical Engineering department has a student team that is designing a formula car for national competition. The time required for the team to assemble the first car is 100 hours. Their improvement (or learning rate) is 0.8, which means that as output is doubled, their time to assemble a car is reduced by 20%. Use this information to determine, Solve, (a) the time it will take the team to assemble the 10th car. (b) the total time required to assemble the first 10 cars. (c) the estimated cumulative average assembly time for the first 10 cars. Solve by hand and by spreadsheet.