UNIT- 4

INSTANCe BASeD LEARTNG

t n cohsast to lraning melhoch hat cnstud

a genesa, exphct desasplon o e target funckion
Ote
homdod ,
Tn slane-boed leamng constuuct -he logt
funclion onby whn a new instante uust be claitted.
Tnckead o toomng Enplhct gereralisaton,
it compores new obems wh nstances n
bhich ane sBoved tn memoy.
foch ame aa new quey nstance is en countoed
tb relakonshap to he trertoudy stored Eramples s
Boned in oidey -to uin a tayget funcior
tuncton value fy
Ahe ne nstance.

Hezglet Leght Taget

150 Medum
155 55 Medun Mediom 4
3 160 lange
4 165 45 lage 2dawes
I57 54

whefver We want to clauctn he vkeo insBance

Ahen h velationship of hee 2 snstoncas baud on identfed
rainiag , baud on that angt
va.
 D Laug leannes (eg: kNN)
Thstance- boud ) Radial baud nckons
Leom ) ase. baud Reosorng
-’ Tnsian (e baud leontng include, neoot neighbon
and locally Lweghted xogessiort mehodh, hat ascume
tnstances Can be depc sented as point, in a Euclidran
Space.
-’ t also includey cae- bOd Veasoning mehod
Ahat e nmoYL Comylex, jmboke Tepre sentation afor
instances.
-’ Instante -baed melhoo ane someimes caled as
lazg' leaning melhods becaue -hgy dloy
a new hstance
nstance must be clasuhod.
Procesing ntil
’ An adrantage ot ths And delayed o) laag

functon once for he entine instance space, these

mehod, con sckmade it locally oud oun
hew instoance. to be cla ssified.
 Thslonce -baud leaming mehod duh as
nAest neghbor aud Jocay wgited Xgesiof
2sSiof Cone

concegBally slaghtfsuand opoochey do arpoinating

eal- vabued on dhscwte- valbrd tougel fuuctor,
’ msdote -boud ogproaches Con Consuct a dilfoent
apoimation to the toyget -funckion for ch dckinet
nstake 4hat must be clossfted.
Advondages o Tmskane-baud leoninge
Traiing is vey fast
lcoon complex tovget fuucton
possbity to dooje informaton. becawe tntre
9 No
instonce space is Cued to clouit lhe neuo instance.

)the cost of clauigg new instancey cau be high.

) n marg msBane -basd ogpooches, spocially
neoest neghoa agpoaches, hy tyrically considen all
aeibutes o) he instonc, hen alempsg o eoteve
fom mem.
on a fes o he
mary avalable olhbutes, hen he nsloncoy hat ane
Aaua most 'Sonlon" noy sell be a
 :
- NEAREST NEIGHBOR LEARNING
basic insBanc - based nmelbod ie he
’ -he mast
k-heasest neghha alg Point
nslances Corurspond to
Onemes all
he n-dimensional space
in
R alsbute vaue (ron, n ’ no: of dimensso%
The neocst nehbors of an instance ose
trleons o he standand Euckdean dstance.
let an onbiaat instance xbe descnbnd ba
he featune VecBo
anl)>
<a,o), a,)
Hene, a, () derdotes he Vaue af -he
atfrbute. af in stance x.

blw 2 nstances x audX

Then he dstance bjus
defsned to be d(s, "), tohe
(a()- 4, )
don )
YI- no: of allvbutes

ncaset nbor Deaning -he taget fuckon

-’ In neave
moy be Elhe ctscete - valud o) eal- valad.
’ led us fst consi der leanning discvete- valued
tonget funcBiom o< he form

V’ finte set }V,

-the -neast st od neighbor ag -for agproximation
a discrede mvalued tanget funcon ís given below

-’ Fr tach training exomple <n, f)>, add he

Exomple to he Jist Araining -examples
classtcaton
’ Given a gusy instance X to be classtfed
Let X- --Xe deRto hek instan cey <from
hat ote. heaie st X
- Exomple
Retun.
k
fa)e amax
veV e|
S(, f))
a-b a
&(a,b) =0 Colhentse.
 -Ve

+ Hoining along oth a

Juei instan oa Xa to be clacsid.
The - Neostst neighbor a
dossiftes 9 tve, whe ay
6- Neasest neghbor cassfies
t as -Ve.

’ # epresernt, the decis;on.

Sunface indued b he
1-neosest neighbor ag
fox a *yricad et af haing

he Convex rbgon Sunoundg sach boaining

indicotes the igon a instance space closest
to that onot te, Ae snslance, fo which he
1- noest neighbos ag wll assign 4he clauisi catio
 ie k Neaest Neghoor ag fa appaoz:ivnaton
a a real- valued tooget fundhon 1s fven belouw
f: RR.

’ F® Each Aaiiag <«f0)>, add the

q to -the lst ainng -exomples
dass:tcoB:on alg:
’ Given a quoy instonce 'X o be dassficd
let -- --X denote he b nstance
from tatnt ng -ExOnples hat are neoyst

Retun

Pistance.-be yted aoest alegnbor algi

k
gma W, 8( f«)
veV
whene

d(y,")
4
 Can dis tance - weight he n stance, f8L
Xeal- valuwd dangt fuuciorm in Sm:lan toay

Once We add dishance we igntyA , Ahee is

no ham n
have
olleuing
an ingluence on the
all trimng tg to
classf;caton the X,
be caue Noy distant ¬ togll hae Vey ltle ct on

he disadvantoge of considening all gs

hot oun clasefren o;ll dun move

If all Oe Considene
tihen class a new guog instonce. calel
a global mehod

ong Ahe ne oust ainn ole

conidoed oled ocal melbod.

 Remane on k-neaest Neighbouwt Aa -
D Orslance 13esgted k neaest neghbor is a higbly
ectve algortam o mang practol troblems.
) Rokust to noisy data f he
taining sel io
lange Enough.
3) Bias s hat he. clossficotion of on
instance. ß most
Similan to ohe instance hat ae nearlag in
Eucktdean dtstance.
) nelevant albud ae a tnoblem. becoUse. distante.
Caleulated. on al attributy called cunse of
dimensionalit
5) Some aproa ches weight alrbutes to 'oVencome thy
Stetcng Jhe Euclidcan space detennine d. auto
mat colly usng cvoss- validaion.
) Jhe n nsk of ovefrg The agproach o loalty
axes is much des Conmon.
corn
) Prachcol (s8ue in k-ne asest neighbor

This processing untid a new

nofi cant conpulation Can

cay be euie o
 FRUIT. to
Oragei from Tomato dicloute
o Cince
4
3"6
Q.2 =45 =
dstance clidean at
Eu Fosmul
? 6 tomato
frust OMage
3
Protcin 6
nuts
vegetotie bean jeen
3
Jape
fout 5 8
gpe Cunchines
Tood Sweenes
Gunckines (Ingiedtent-tomato
-6,Soecney ,
)-
in6lonce iven for
oyre 4he predct aud akNN Ara
food