Question

K-Nearest Neighbors The given data contains pairs of points and their corresponding class. (2,5), 1 (1,5), 1 (48,35), 2 (42,

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Here we want to determine the given points class using KNN(K nearest neighbors) algorithm in the given data points.

For different k we predict the class of the point and the answer with explanation are given below,

Given , their connesponding pains of points and 1 and 2. class . There ane tab classes Points class (2,5) C15) (48, 35) 2. (4Euclidean Distance Note Euclidean distance between two points A and caleulated by, B Ce - A1 )82-A2) dCA/B) Hene Find paintsclass label ot Selected Sample is 1 So fon k=1, is 1 class C15, 16) polint Fao k-2 Snoallest two Cue Select distance the FromHere the majority Class label is 1 CI5,16) n the class 1 So point C30,40) calcutate the Guclidean distance fnom (30,40) to trFor k2 Fnom the distance Sraallest distance we Select two Samaples They ane C48,35) ,2 distanie 18. 681 aith distance (42,12)C0,0) Pro m(0,0) distance Euclidean the Calculate training Sample s to all class Cucli dean distance from Co, 0) Paint 5.385Foon k 2 Fnono the distance select 2 Smallest distance we Point they are, CIus), distance atth 5.049 C2,5), cwith distance 5.

Add a comment
Know the answer?
Add Answer to:
K-Nearest Neighbors The given data contains pairs of points and their corresponding class. (2,5), 1 (1,5),...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Classification in Python: Classification In this assignment, you will practice using the kNN (k-Nearest Neighbors) algorithm...

    Classification in Python: Classification In this assignment, you will practice using the kNN (k-Nearest Neighbors) algorithm to solve a classification problem. The kNN is a simple and robust classifier, which is used in different applications. The goal is to train kNN algorithm to distinguish the species from one another. The dataset can be downloaded from UCI Machine Learning Repository: https://archive.ics.uci.edu/ml/machine-learning-databases/iris/ (Links to an external site.)Links to an external site.. Download `iris.data` file from the Data Folder. The Data Set description...

  • Question 3 Given the following data points, use the K-Nearest Neighbours (kNN) (k=5) to find the class for age<=30, income=medium, student=yes, credit-rating=fair. Show your calculations and the fi...

    Question 3 Given the following data points, use the K-Nearest Neighbours (kNN) (k=5) to find the class for age<=30, income=medium, student=yes, credit-rating=fair. Show your calculations and the final clusters. For similarity measure use a simple match of attribute values: Similarity(A,B)= equals bi and 0 otherwise. ai and b i are either age, income, student or credit_rating. Weights are all 1 except for income it is 2. 5%, *c(a,,b,)/4 ,h ) is 1 ifai where cla -1 studentcredit rating dass RID...

  • Problem Definition: Problem: Given an array of integers find all pairs of integers, a and b,...

    Problem Definition: Problem: Given an array of integers find all pairs of integers, a and b, where a – b is equal to a given number. For example, consider the following array and suppose we want to find all pairs of integers a and b where a – b = 3 A = [10, 4, 6, 16, 1, 6, 12, 13] Then your method should return the following pairs: 4, 1 15, 12 13, 10 A poor solution: There are...

  • 1-Suppose you write an application in which one class contains code that keeps track of the...

    1-Suppose you write an application in which one class contains code that keeps track of the state of a board game, a separate class sets up a GUI to display the board, and a CSS is used to control the stylistic details of the GUI (for example, the color of the board.) This is an example of a.Duck Typing b.Separation of Concerns c.Functional Programming d.Polymorphism e.Enumerated Values 2-JUnit assertions should be designed so that they a.Fail (ie, are false) if...

  • . Huffman Encoding (a.) (6 points) Suppose a certain file contains only the following letters with the corresponding frequencies 1 AİB 73 9 30 44 130 28 16 In a fixed-length encoding scheme, cach...

    . Huffman Encoding (a.) (6 points) Suppose a certain file contains only the following letters with the corresponding frequencies 1 AİB 73 9 30 44 130 28 16 In a fixed-length encoding scheme, cach character is given a binary representation with the same number of bits. What is the minimum number of bits required to represent each letter of this file under fixed-length encoding scheme? Describe how to encode all seven letters in this file using the number of bits...

  • Question 2 - Programming Exercise 1. Make a directory for this lab and change into it....

    Question 2 - Programming Exercise 1. Make a directory for this lab and change into it. 2. Copy files using the following command: cp/net/data/ftp/pub/class/115/ftp/cpp/Inheritance/Exercise.cpp Exercise.cpp Finish the program so that it compiles and runs. The instructions are contained in the C++ file. Your completed program should generate output similar to the following: TwoD default constructor This program asks for the coordinates of two points in 3D space and calculates their distance. Please enter the xyz coordinates for the first point:...

  • Programming Assignment 1 Data structure Java Implement Shellsort for a linked list, based on a variant...

    Programming Assignment 1 Data structure Java Implement Shellsort for a linked list, based on a variant of bubble sort. The rather severe constraints imposed by the singly-linked list organization presents special problems for implementing Shellsort. Your task is to overcome these constraints and develop a simple, elegant implementation that does not sacrifice efficiency or waste space. Step 1. First, implement a routine to build a list: read integers from standard input, and build a list node for each item consisting...

  • In this assignment you’ll implement a data structure called a trie, which is used to answer...

    In this assignment you’ll implement a data structure called a trie, which is used to answer queries regarding the characteristics of a text file (e.g., frequency of a given word). This write-up introduces the concept of a trie, specifies the API you’re expected to implement, and outlines submission instructions as well as the grading rubric. Please carefully read the entire write-up before you begin coding your submission. Tries A trie is an example of a tree data structure that compactly...

  • 60 points, Complete javadocs documentation required Be sure to submit all files (.java and dictio...

    60 points, Complete javadocs documentation required Be sure to submit all files (.java and dictionary.txt) required to run your program Background Boggle is a word game using a plastic grid of lettered dice, in which players attempt to find words in sequences of adjacent letters. The dice are randomly arranged in the grid, and players have 90 seconds to form as many words as possible from adjacent top-facing letters For example, the word SUPER is spelled in the gameboard to...

  • Do the following project: Following is the file to be programmed in Linux kernel. Run this...

    Do the following project: Following is the file to be programmed in Linux kernel. Run this program. Include the screenshot of the results. Multi threaded Sorting Application Write a multithreaded sorting program that works as follows: A list of integers is divided into two smaller lists of equal size. Two separate threads (which we will term sorting threads) sort each sub list using a sorting algorithm of your choice. The two sub lists are then merged by a third thread—a...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT