721
edits
IFD:EAI SoS21/course material/Session 4: Programming the Classifier Part1: Difference between revisions
IFD:EAI SoS21/course material/Session 4: Programming the Classifier Part1 (view source)
Revision as of 20:39, 5 May 2021
, 5 May 2021→How our classifier works
| Line 5: | Line 5: | ||
[https://replit.com/@abnutzer/Homework-2-Solution#main.cpp Calculation of the Centroid] | [https://replit.com/@abnutzer/Homework-2-Solution#main.cpp Calculation of the Centroid] | ||
= | =How our classifier works= | ||
Until now, we have been looking at points on a 2D plane. We know how to calculate the distance between them and how to find the centroid of a point cloud. Let's call these point clouds classes from now on. With this tool set at hand, we can already code a simple classifier. We could e.g. detect whether any given point (P_new) is closer to the point cloud which we call class_0 or class_1. We can find out, by calculating the distances of P_new to the centroids of the classes c_0 abd c_1 as shown in the picture below. | Until now, we have been looking at points on a 2D plane. We know how to calculate the distance between them and how to find the centroid of a point cloud. Let's call these point clouds classes from now on. With this tool set at hand, we can already code a simple classifier. We could e.g. detect whether any given point (P_new) is closer to the point cloud which we call class_0 or class_1. We can find out, by calculating the distances of P_new to the centroids of the classes c_0 abd c_1 as shown in the picture below. | ||