K-Nearest Neighbors (KNN) Algorithm - Introduction and Applications
Offered By: NPTEL-NOC IITM via YouTube
Course Description
Overview
Explore the K-Nearest Neighbors (kNN) algorithm in this 26-minute lecture from NPTEL-NOC IITM. Learn about the fundamentals of kNN, including its applications, underlying assumptions, and step-by-step implementation. Discover when to use kNN and gain insights into crucial aspects such as parameter selection, feature scaling, and the importance of feature selection. Through illustrations and practical examples, understand how kNN works during the testing phase and grasp key considerations for effective implementation.
Syllabus
Introduction
Why KNN and when does one use it?
k Nearest Neighbors
Assumptions
Algorithm
Illustration of KNN (Testing)
Things to consider
Parameter selection
Feature selection and scaling
Taught by
NPTEL-NOC IITM
Related Courses
علم اجتماع المايكروباتKing Saud University via Rwaq (رواق) Statistical Learning with R
Stanford University via edX More Data Mining with Weka
University of Waikato via Independent The Caltech-JPL Summer School on Big Data Analytics
California Institute of Technology via Coursera Machine Learning for Musicians and Artists
Goldsmiths University of London via Kadenze