In this 2-hour long project-based course, we will explore the basic principles behind the K-Nearest Neighbors algorithm, as well as learn how to implement KNN for decision making in Python. A simple, easy-to-implement supervised machine learning algorithm that can be used to solve both classification and regression problems is the k-nearest neighbors (KNN) algorithm. The fundamental principle is that you enter a known data set, add an unknown data point, and the algorithm will tell you which class corresponds to that unknown data point. The unknown is characterized by a straightforward neighborly vote, where the "winner" class is the class of near neighbors. It is most commonly used for predictive decision-making. For instance,: Is a consumer going to default on a loan or not? Will the company make a profit? Should we extend into a certain sector of the market? Note: This course works best for learners who are based in the North America region. We’re currently working on providing the same experience in other regions.
K-Nearest Neighbors Algorithm (K-NN)
작업 영역이 있는 분할 화면으로 재생되는 동영상에서 강사는 다음을 단계별로 안내합니다.
작업 영역은 브라우저에 바로 로드되는 클라우드 데스크톱으로, 다운로드할 필요가 없습니다.
분할 화면 동영상에서 강사가 프로젝트를 단계별로 안내해 줍니다.