Scribd
Upload
9 views

Module 4_chapter 4

This document discusses similarity-based learning, focusing on instance-based learning algorithms such as KNN and its variants. It highlights the k-nearest neighbors (k-NN) algorithm as a powerful classification method that classifies new instances based on the similarity measure of stored cases. Additionally, it introduces the weighted k-NN algorithm, which assigns weights to neighbors based on their distance, enhancing the classification accuracy.

Uploaded by

rohith p
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Module 4_chapter 4

This document discusses similarity-based learning, focusing on instance-based learning algorithms such as KNN and its variants. It highlights the k-nearest neighbors (k-NN) algorithm as a powerful classification method that classifies new instances based on the similarity measure of stored cases. Additionally, it introduces the weighted k-NN algorithm, which assigns weights to neighbors based on their distance, enhancing the classification accuracy.

Uploaded by

rohith p
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Introduction to AI &ML(21CS752)

MODULE 4
CHAPTER 4 - SIMILARITY-BASED LEARNING
4.1 Similarity or Instance-based Learning

4.1.1 Difference between Instance-and Model-based Learning

Some examples of Instance-based Learning algorithms are:

a) KNN
b) Variants of KNN
c) Locally weighted regression
d) Learning vector quantization
e) Self-organizing maps
f) RBF networks

Nearest-Neighbor Learning

 A powerful classification algorithm used in pattern recognition.


 K nearest neighbors stores all available cases and classifies new cases based on a
similarity measure (e.g distance function)
 One of the top data mining algorithms used today.
 A non-parametric lazy learning algorithm (An Instance based Learning method).
 Used for both classification and regression problems.

Dr. Sudhamani M J, Professor, Dept. Of CSE,RNSIT 1


Introduction to AI &ML(21CS752)

Here, 2 classes of objects called


C1 and C2. When given a test
instance T, the category of this test
instance is determined by looking
at the class of k=3 nearest
neighbours. Thus, the class of this
test instance T is predicted as C2.

Algorithm 4.1: k-NN

Dr. Sudhamani M J, Professor, Dept. Of CSE,RNSIT 2


Introduction to AI &ML(21CS752)

4.3 Weighted k-Nearest-Neighbour Algorithm

The weighted KNN is an extension of k-NN. It chooses the neighbours by using the
weighted distance. In weighted kNN, the nearest k points are given a weight using a
function called as the kernel function. The intuition behind weighted kNN, is to give more
weight to the points which are nearby and less weight to the points which are farther
away.

SUMMARY

Dr. Sudhamani M J, Professor, Dept. Of CSE,RNSIT 3


Introduction to AI &ML(21CS752)

Dr. Sudhamani M J, Professor, Dept. Of CSE,RNSIT 4

You might also like