2) Consider the classification problem below. There are two classes A (squares) and B (circles). All data points in this domain have integer values. We want to classify the triangle at (5, 2). A) What classification would most likely be given by a linear classifier? Justify your answer with an explanation and/or picture. (2 points) B) What classification would most likely be given by a 1-nearest-neighbor classifier? Justify your answer with an explanation and/or picture. (2 points) C) What classification would most likely be given by a 3-nearest-neighbor classifier? Justify your answer with an explanation and/or picture. (2 points)
Added by Elizabeth W.
Close
Step 1
``` 10 . . . . . . . . . . 9 . . . . . . . . . . 8 . . . . . . . . . . 7 . . . . . . . . . . 6 . . . . . . . . . . 5 . . . . . . . . . . 4 . . . . . . . . . . 3 . . . . . . . . Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 51 other Intro Stats / AP Statistics educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Arrange the following steps in a k-nearest neighbors analysis of a classification problem in the most appropriate order (assume k is fixed): a) For each point to be classified, find the k closest training observations and classify using the most common class. b) For each point to be classified, calculate the distance from each training observation using an appropriate distance metric. c) Standardize the predictor/feature variables if appropriate to do so.
Rashmi S.
a) Given are the two dimensional points A(2, 6), B(3, 5), C(4, 7), D(9, 2), E(5,10), F(11,7). Compute single-link bottom-up hierarchical clustering using the Euclidean Distance formula. Show the clusters representation in xy-plane and draw a dendrogram of it. b) Given are the points A = (2,3), B = (3,3), C = (3,2), D = (-2,5), E = (-3,-2), F = (-2,-2). Starting from initial clusters Cluster1 = {A} which contains only the point A and Cluster2 = {D} which contains only the point D, run the K-means clustering algorithm and report the final clusters. Use L1 distance as the distance between points which is given by d ((x1, y1), (x2, y2)) = | x1 – x2 | + | y1 – y2 |. Draw the points on a 2-D grid and check if the clusters make sense. You may stop the clustering process if it found that two iterations have the same clusters, otherwise, at least 4 iterations are required.
Juhi S.
Recommended Textbooks
Elementary Statistics a Step by Step Approach
The Practice of Statistics for AP
Introductory Statistics
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD