eee q {intelligences (By Howar d Gard °. y Naturalistic tntelligence Senslecey *loalaoan | Musical intelligence 3» y Logieal- Mathematical intelligence Existemial intelliqence: 6) Tnterpersonal intelliqence g Bodily kinesthetic intelligence 4 Linguistic intelligence. 9 Intyapersonal tatelligence- 9 Spatial intelligence 05|09| 2020 \laceum Cleaner problem PEAS Description * Performance + Using least no. of operations possible Por sowing the problem. Environments Two rooms cmeant to be Cleaned) Actuators Vaccum cleaner sensor: Camera which detects Cleanliness of the oom. Graph description + Tnitial state: Any selected state out oF & Goal state: State 7 ox State 8 Opesations: Move and clean Cost per operation: 4 unit State diagram + 8 states conose quaeh is | L wepres ented: tdpo rove ty | | i | zr [NOlor =| CoC clean / \ siate 4 State 2 2 “op State 3 Stale s Stort/ tnitial O1 o2 03 es 2 ay aa OF 30° 38) 32 PO Ai ao A 20 Situationsr case- 4 i Case-2 o 60 Operations : O'oQ 1 4 0 FIN first fug- A oS 5 4 3 Fill Second jug-R 30 4. 0 _ Ernpty First jug +< 33 a4 Empty Second jug-o 42 ae a POUT IW aug —¢ a Pia 3 — A -) jug -F <6 QB. 10\09/2020 4 Puzzle problem Right. yotation ? Clock wise Left rotation: nt Clock-wise hich Ghould hot be there nm the Oead states } The State Onreachable States? Nodes | goals uohich can't b through any yotations. iN} oa\2220 initial. e yeached 4 Fina): Pet |Ai Using Right Rotations In this case, fa fs] is unreachable Stole | fs] > 4X3xa= ay POSsi bilities > Onld 18 are reachable in this case and the other are UN éachable StatesMisstonaries 4 Canibals oo | R f i Maxs 2 Nw w KR Missionaries Canibals abe ae t crf ———> F f <© de =" ae ab ——=> 04 <€9 be@ ——— abc 4 <® abc toe e ~ abe ——_ ae Aef: Dead states: Lept stde('6 stats) 33 Br ai) 30 dead state at G3) 8a nigh +) Gay) ou (Oo et ox og Ol O29Ci My Cy —_—_—_—_ Mi Mo <© M, M2 M3 Co — bs 8 TO <@ My, M2 M3mc Ba- States | ; : 10 - Operations 3 Q Sy Left boat 1g-dedd atates a > 82 stateCnode) 3 Oo SS. vight boert 2 3 a a Thitial state Gav) a ) a - 6 Final state : 3 Operations + , 2 Le a» 1 \ ae A ee \ Oo ae ek a Re 1O -Operations Se) ae aM o ' Spee u Ps wea bug et Mine Sweeper. loal2020 Mine surrounded boxes should be + 4 Dangeree Wee Erde talib) oe i > Robo should vistt all the Safe Tooms in the game _y We cannot solve this problem ky qraph theo, because ‘ + To vaccum cleaner problem we can see the initial state ie., Which voorn is dirty and Wher ig the vaccum cleaner. But in this Case we don't KNow where the mine is, the game starts With empty boxes. | — Without knowing the Situation we cannot proc. -eed through the graph. att ) >t © is there wwe should proceed to 4 another room and ff 4 i there, We Should proceed to clifferent room. > We do not have if condition in graph theoy, Only nedes are connected in the graph Canto Tf condition is different from Vaccum cleaner if Condition). “Types of Environment 1, v chess YD Fully observatle / Partially” Gbeewable. vw ee Cay-ya, 4) Discrete /Continuous | ches 3) dete / Dynarnie shia 4) Seresminione Con, Tacing Vs Stochastic 5) Episodic Vs Non- Episodic ) Style ogentVs Multiple dgent-“get An agent is anything that lalodanse "Ml \9\o9\202.9 can be viewed as percieving its environment through sensors and acti upon that environment through actuato oO YS. bay} pe | | | Percept: “The term. percept is Used to represent agent's Perceptual inputs at any {instant Sensors Human agent t Eyes €ors Nose Skin tongue Actuators: Hands Leqs vocaltiact Robotic agent Sensors: Cameras , Anprared sensors. Actuators. Various motors. Software agent Sensors; vecelvers » Keystsokes, Actuatore: Display seven, mlsitiog FES @ Sending neroork packets. re a aired ) mple yeflex agent ba based vegiex agent Seal based agent 9 Guy Pectlity based “agent: file contents ndD roy TE Agent /edhat the worl | ‘1S Whe mow | \ | | Condttton - | | | | [ore ed ree yules role | = | “GyiNoqure cleaner ‘Naccum Cleaner > They choose actions only based on the cunent Percept. f > Trely environment is Completely observable. Condition action-Rule: Tk v3 a yule that maps a Stee Ccondit’on) to an action. = N y ‘ Rg 9 "| M| € N T 1 Mine Sweeper € N v \ g ° N N E N +Uninformed Search Strategies AYl04 lon Graph traversal. key- . qyeyauwe Deepen'ng * wy gol) tent = ort) aay Umit > 4 Or Limit = say) [mit = 3 v Uniforrd, cast Search 53 MD OO 4G= ID Goal node coith least cost: Ei-Directional search + —=— Tt means we search parattelld prom Source to geal and gpa to gource:26|oq]a5,0 Informed Search strategles :p 94 edly best for search 7 @ ®@® © Bad 253 Bay «6 @ 6 366 880, : S O-0ka Node 253 ° a) A% search. ® Qo ® 329-53. 3TH +NS 140 _ 75 “4aT 393 44d (A-s) ~ 14d aie 1S a 0 CS-R) (s-A) +189 yo 140 a Sa tas 140 ) "Eo $01 ug com 8 aa 535 HIS, 853 0 55 140 140 7 a4 a 4) 6 ® 54 u50 ais » i cth is lag io ; 7 HIS A 7 at cs — ~ oT bm SS R> PBExample for A * Search: ' ip) optimum path Gy A> P2GoTed Lo) De G&D ® © 8 6 cae = _3 CA-F) 14 al, A) GF) rehie = _a(F-A) 2 \e ie § ( : 3 4 @-er (A-D a 3 (3-9 z 4 iz 5 ieee ag apduersorie! | 4| toJa026 Miramax algorithm PL Nes No 9. Po Ves No Ye No Pi pF fr Mes es ZS 2 sty) aed o tt Is a cvaw game Po =-4o Ptoo 20-40 = -20 Peas Py = -15 CPe won) (e wins if + , Pa ules if - score)" a5 -15 340 ee CPi won) ee algoxith. t=) Nlaximbzer JN 2 => Minimizes Vv> selects max vai, > Selects ma, Value Oraie tac toe Ome > CStatic envisonment a =a onment ore FPR OSCE Steps) | Oyo . - \ ~ ol lf Pa options. © [*LO of ole ojolr, fi of IP @ hewn o irs, [New ®, opti TL Oyo oh} © fro °o | 1 options | S flo O|r o If é a : P18} © P e, O'R, were P12, “ ! 4 I 4 Draw’ —) oa (Oraw) oe (won) (fa won) Utility \raluesAlpha - Beta Pruning OSLO ro."| eee ev ol functions 08| lola2006 - : 20. a of Search It of? test { ale . + Quiesence eature > Quisence | ce! io ce) Search . wi 2 Ly ~ SLA) 9S co) =| =] cocny 9 5c8) 9 8D 3 we 3s) so)SCAY > wc) V WCB) SB) > w(A) 0 WO SLO + wef) u wD) ln an S00) > we v w(c) (gat) © > ws CNo Strentch) md N WA DSS CUB ive “6 's tue (i.e, wmpus & present) C> nw(c) 6 CG) PP ween) M wed) SCO) D> wWLAU WD) (De Morgar! SCO ~> wwe) wun) ——«#2) 0 > scp) SO)> wo 8) Uday Te ==. (wwa) wR)00 ST PROBE . " BR] & STS wHy)> 3 (4-4) 8A 6 (14,4) Stuy) 9 s(uy-) sy) > W(t-LY4) Uw (4th y)U wT yr) V OCL4-D fame tor pit d Breeze and qo'd & gli-ter AECO,0) , MS > mwloit)s nm W (1,0) » 08 > vor!) ~ e( 1/9) 0 Gt 3» @ (Or) 0 @ (1,0) * L001), @cor) >P oy2)y eli) 7S (0)1) mw (O2O” wl)f Ai bn) 2 stu ew wiv oere 0B (10) > velo (210) ACD, geod wo @ (42) > G(a!)vd 4 Backward Chaining: 24/2020. : Peal Base: Known facts kn KB Fc B.c —— A A AB 8 Agee c wc, A AnB2 0 e j D H enc 3 F a Fe anD3G : €4H a Be? His true. it \ Logic. + The Wmpus wosld using propositional 19 84) 2 (41,4) ns(@tty) nscoydo sao q ee BU-1,q) NACL) 4) na(ug-Ieet 9 ge apnatars yy ng I a.SAHYpe Ly (Atay UW OY) U WOO G0 WOOLY 4) aon 2 BOUY) &yP(A-LY)UPOM ry) 0 poy) VU PC2.yH1) GOL y= eu (xy) p aed! A) Goid(-4-)U Gold (ay A& BUC Ae) BUC)! <> Bac! yn SOUMS Cwer-yjoTwoorr yy] ole Yo) i) [wcnyry)' At (0/9), 05(4,0) (W110) a(wto,) WBE PCvO) A PLO) © GE(0)0) 5 God Co) A GIA (Or) Already checked ©S(0)1Kk=> wpHtOro) 0 rowlo,2) 0 W(t!) BLOMES (0,2) VEL es STG y Goa ALCO), | SW WL y W(2,0) V wt) no Cera OP(2,0) Nw PL) ft), Cenmienana bat ne Gold (211) U Gold (12)yee) = WhO) NewLA7®) 9 Suns. ne ww (ait) — ji vol) & Pleoe 70) PU) a) 9 Pan} a és ! ad, , a i ygtl(uy peat) —_— ound . Firet Order Logte : wC0,0) u WO,t) 0 WCO,2) ----- w(3, 3) Jx( Room x )-> wad) Fx wa) Vx Light co] Probteme tg an tenal s-Eithes td cunostty Tack Owns a dog. Every doq cuoner al lovey. No animal Lover Kills an ne or Curiosity Killed an animal +0 des hie anienal 2 sons (Jack, doq ) Va [Ouns(1,doq)—> Atco] , dra Kills (1, animal)Kills (Jack, animal) oO kKils( Cumosity animai) Kills ( curiostty ,animal) =? Resolution in Fist Order Logic: > Convert FOL to conjunctive Normal Pow Steps: 4. Eliminate Implication s A>B > AUB A&B = A's’ +AB 2. Move ‘as’ negation in wards vs — «wa Sz ~p mdr Pp = Vx op 3 Standardize variables 4- Standardize variables (Remove existential Quontifiers) . 5: Drop Universal Quantifiers 6. Disttibute U over 0 (Ang)ve 2 (4 uc) 9 (Buc) Vx (Owns( x, doq) > Alex} Via (wowns ( z,40q) v Ala) ory ( ALG) > Kitts C1 Onimals) fe 3x (~ Ak(x) U Bills ne) .P yrole Al(4)O kiNls(1,animaiy)) | > xl Alcaz) 1 Kills (animal) ected S3r(aio owns(1,doq)) wat? Ly Alec) fy owns'(c,/doq) ceé pesson( Jack, curiostty) 1) Owns (Zack, dog) 0 AL( Jack) ; wy owns (Curiosity, dog) U AL (curiosity), Al(Tack) N 10 Kills(Jack , animal) Al (curiosity) © Kills (curiosity animal) \7) Owns (Jack, doq) kills (Tack, animal ) UV kills (Curiosity : arin = AL ( Jack) Nkills (Jack, antmal)) Kills ( Curiosity ,ant mab) + Curiosity killed the animal,'Y 12099" Machine Leasring. Artifical Neural Networks: , Arctificval ————= : Features of Neural N/ww's ? Robust and fault tolerant: 4. | 2. Flexible 3. Ability to deal with dipferent Si tceation of data. 4. Collective computation. Characteristics of Neuzal Artificial Neural Network speed: Slow 4) Processing: Parallel 3 Size d Complexity: Very large a Complex yD Storage: Synaptic lights )5) Fault Tolevance: mote 6) Contso Mechantsy ; No Control Networks! Classical Compuler Fast : Sequential. smal) dq simple: Memory devices: less Centsal contol AModel oP 2 NeuTen- en wy > Synaptic weryhts < Activation value o/e Activation ‘summation Artificial Neuron Uneas function: Activation (voi) + Wats -.--- WrTn) = output Teminology : 4) Processing Ontt: sum + activation Exhitorey Ip - we weight Inhibitory I/p- -ve weight AX) Ip state o/p state activation) 3) Operation (summation » ' C the (ayes Sind) 4) Update Synchronous Co" edtated ate, A nchronos (upiatng ey 4 (2 Methods 4. Me Calla, pits Mode) DO updating weights Ta_ws ol” mel «©,Q. Perceptvon model . Pee eae, | a 3/p 4 -» e —> P —> Ip Cyvoy « Expected - Actual. 3. ADALINE model Adaptive Unear Element Accepts analogos Values Least Mean Square _ 2 An Error Topologies : Group of insta : ae L, Bidirectional . fesoctatve Autg fssocta| —_—n ctPvatfon Functfons : 20) 11) 2025 WL Ty Model of 99 pwificial neuron Vp * the activation function Cie, %s ist Thig is how i hora _actvat” then ofp 1s & threshold GC F Tfunction cooks a ed agit: > Tf the So then the Op > xf H Produses linear cweightecd Sum as op lp: near activation (2) = % (GAXT, + Wyh t-- WT y Wyk Bias). Op xange } -~-o to +& 2) Thyeshold Activation function! produces ole based on the threshold value (t) ofp? thieshold_activation(z) = 4 Wf 27-0 (z/») =o if z<0 Considering '0' as the threshold value, &) clp ange + O o¥o 4: 3) Siqmetd Activation function : ~ produces the sigrnotd value as Olp. Olp : stgmotd activation (2 ) = fre) op *ange: © to. 4 (contnuous values) 4) tanh activation function: > produces the hyperbolic tangent value op near weighted sum as op Ap: tanb_ activation (z) = tanb(2) Clp wonge 1 ~4 to 4 (contfnuous voiues): 6) Plecewise Linear function: — preduces COn Hauious ofp as per the difperent ‘F equotions ( formulae) defined on Z value: 4° eat -ple plecewise \fheay fonction , aeee . ofp 2 . 5 one jose linen activation (2) = 0.5, Prec -o5 _ » WP 0562205 2tO5 >, WE 275 OF (taxing 05 to +05 a5 the intesval) dp aongt | depends on +he Foterval of the functions (equations ot formulae) defined on Zp eampie , -~o5 to tO5 Continuous values). 6) elu Function : stands -for Rectified Uneas unt. based + > produces 0 bo +# continuous values %S op op z value. Op: yelu_actvation(Z) =O , iP zzo = Z | if 7=6 fp vange: © to to 9) SoPtmox Function + > Wis function takes sel op real numbers 99 tle and produces a set of real NU The 10: 0F Op values represent the no. of classe Nalue in the ofp wepresents ane psotoblity abe ‘Ip Values being classiPred oS thy Op class, No Example, i. trained classes are dogs, cas: hers, ne Of the se. Tose? 10:0 ul Se Suppose the °/e values are chances oF the ye 1 0.0¢2, : Veo to, sey This means the ee Classified as dogs , cate: hen? and none agsk these are sy'n, rh, th, 44’, vespectwely. Olp . velu -activati oe : lp activation (2) = e; /Cale)) {i | -¥ K sepresents total no. of Classes ofp Range: 4p produce 4 {probabil Al ofp values Sum Crioo'), chances Various Classes - distibuted to 8) Signum Function; > Produces - OY O OF 44 values based on = value ap: Siqnum_activertion (ze-t ,iP z<0 =O ,\Pz=o ett, tp z>0 Ofp Range: -4 oF O ov+s (discrete values) 4) Prctoo Function t -> psoduces ‘inverse hyperbolic tangent value hz as Op. ofp: actan_actvation (2) = tan h'(2) olp Range: - Me to re rreshold + Zy Ty Blas WW, We §M ” ole Oo 3 Oy ' O06 OF -O2 OO L % Linear: I, Ig Bias WO, Wr, Mb 7 olp 3 OG 1 OG OT) - D2 OW 0:18grr | gn of L Bias © Wa WW 2 b By Doe 4 06 OF - P 03 O4 O2 Ong y OsSyygz Qelt! Ps ta Bias WwW, Wa WE ofp 034 1 O68 OF -O2 O18 Ong 08 Ow \ Ge 05 =O 7052 6 03 Oy \ O6 O85 Ol 0128 698 Lon, ty to Blas, wm, Me Wp a olp 03 o4 t 06 O85 O11 G28 627240 axctan w n 0 Se fe a [gs Oe é 03 Oo 1 ae oF -° Bock Propagation Algorithm: an 2090 w Blas (+4) A » wy - a p- 8 > Neuron. Pro —teceduve (to ‘train Newyon to perfor) - £ } Antialize Rardorn conlgts 2) ho fox each "Ip Conbination t Dae || S802, Back propagate 4else, finalize welghis Bock Propagation. Wey, = Wyt AW AW = ": 4p I)p e108 | eyo = cp a ) ty = learning ate or Gate Neuson ae oR Gate A 6 lo} o oO lo ile w, Wy, Wy, DN olp arn d0 0:1 0:36 O63 fiestas 1oaty 70 4 Not desired (bcoz Pos 00 tp It Should produce o fo OR qed) - end = Expected Olp - Actual ole = O-4 =-4 Let N=4 Aw= 4:0 "Jos a Awe 4.4.-4 ae 4 For wp: >Updake values accordingly. by od ding Aw ile vy, Wr Wp, nn olp 00 01 0:86 -031 20 0. (accepted):Hy ot 0:36-0:37 20 WE n Ersoy = Expected olp = Actual ole lp 7 4 © Cnot desided) Expected O|p =4 = 4-0 =i awe tot = 0 Cur) aw,s 44-4 = 4 C2) AW, = 4-2-4 = 4 Cp): Update values jp 2 Wh n Op bs OT 636 0-63 FO CAccepted) ile : Accepte 10 ae Oe (Accepted) 7 70 : 00 wo! & desied) ‘ esror > Oat! Se et se ea aes dp Ot wae -oeT <4 0 ————_—_—_—_——— 0) ae 40 >0 14 70 All the Combinations are quid hese : waits are fixed, w1= ed) OF oa o c Accept 4 ( Accepted) ( Ace epted) (recep) A olp ° w,7->* oe) 7 «<4 ane desMachine Learntng. 26|N] 2089 ~ 4 . Saperised-G Fairing data Keating ae re) ‘ ata given tna Single foidg) Unsupervised 68 Ke a Sem supervised i CReinPorceme nt)-& Critic Statoatements a i ie will be given if the Experiential / Trainfng a Olp is notes desixd) LJ] 3Ty) Clossification me “i a Supervised Leas Futts data i i> Trateting data Colour | taste Shape 6ize | Smet) | Name ved + | sweet | Oval | | ayz | Applet (felloo Green+ | sour | Oval | medium, pas | Mange Yetiow “Red Sweet | Oval | med xyz Apples- ‘kp i ole Nara Sweet Oval Large ayz Apple Ly Testing datadata | Expertential data ; rah | Face eg? C Face Recogntton). ahape colour “Texture eye-dist vv 10 923 ad to 20.5 | p 4 uN 20.0 ay 1.3 dd ey 10.5 195 20 u 2 c 4 n 120 a ial (a Qs 4 $ 60 18 8 "9 Ps =i “I g QQ =|0 15 es 66 102 QO K ih pa AQ ae a 10 18 2h Ons upervised = k-fold —=—S——— i.e, Trainging 4d Testing Bata given combinely k -foid method. data not specified then 4% Data he - fold: 4 Tteration 2% ', 3,3 Craid & (Tes . ttas 34 cralning 4° Q Ctesting) 4 Theat 1,04 (teolning) 5 ( Testing) training) ae sta: 034 4 (testing) -> All dota is ‘dined ids Tested. 0 Sem ~ Supewised : Supervised + Unsupervised , Reinforcement 8 b qwes some critic statements VF the olp i, not desired one. Ex: You are far from answer Nou are & step awoy from ANSURY . etc, 4)12| 2090 Malti Lay ex Perceptxon Multilayer perceptron neural netioosk has one Ve Layes oF neurons , 4 or more hidden layer oF neurons and an Op laye of newons. The Jp layer just forwards Te ip vatues the first Hidden layer of neurons. The hidden layers keep producing the intermediate vesults 4 fouwards *t to the next layer until ofp tayer *s seached. The O/p layer psoduces the final Ap. Mult lovey fava. cten. aYo layer mect tn Ip ‘4 cue eee ae area te, to => Hidden layer neurons LOnly hhdd. - one e tayer Is present) Os, Os => Olp layer neurons _e» Tilt KE +w0o 'Ies while yd O, produce g olp's- Assumptions ¢ L Activation function ts Signo! d -for all. Hdd en and output layer cS g. Error calculate A fg mean aquaved, E10¥- Enos =(£))4 (desde — actualelp) = wu - leaming-rate + 4 ( Totat— Exor) [Partial derivative of tobal E70" with respect Uuyons 3 Learning Rules cern +0 weight +0 be updated | 4. Single bias ‘5 connected *° au) the neurons in each layer p's Calculation + of tle's of a Stn) represents Itneaa weighred sum Neur ‘ on \N-. na f +pe neuro? OW) vepsesents activation Value © at = (3a¥ we) + C2 4005) + “bd (ay - 4 / ca e809) haS CHa) = Ga ¥iOs) + (Fatwe) Wete p. , M Ola) = 4 (see e?) 5(04) « (ocHa) a ws) + (OCH) w4) +Wbe tos) + 4/ (ste S (04) S (Ox) = (olHe)* we) + (oUt Ww) + Opa O(02) : 4] (re789) : Evy Calculation t catcudated for each Olp layer nenm Enor value IS errors Of all Olp tayes neurons ts The Sum of the colled “the tat SOO: 1g? extor produced, by % Nexon €CN) represents p os Tages olp ot DLN) represents Neuron ‘N). E(tota) represent: Oetwork. E(Os) =(£)¥] 0(0)- o(os)]~ € (02) = (£}4 [ D(02)- OCOs\\" E (total) = e(O) + € (02) | Weights Updatfons The Product of learning wate and the parti derivative Of total error ewith respect 40 the. indivi ~ dual weight is subtracted from the previous weight: , Destred of 5 the total evroy of xhe neura aepresents esyor Ecn) *°P Produced by a Weuron ih ‘ t aitt A & Neu artial derivattve Is calcul ron ‘y), the Pp ated Occ ording ty i chato wule as fellows: 4 cttota) , A ectotal) + A oc 4 4 wo AocN) : dsc) : wi where N 'S the neuron *O uohich the weight fs attache d. ‘ Lp La) w Ss ° it a te can be understood as the contribution of % ht to the total error fg equal & the f the ole of the neuon the linear cseighted id the contsioution Particular weig product of the contribution © to the total EOYs contribution OF Sum of the neutron to jis O/p an OF the weight ‘© Produc Ofp layer weights Opdation 4) Ws updlatfon A ectotal) <4 “dW, Sen (total) %, a) 4 Wenp 2. hy I Sepa tte = tl ( (0s) -0(05) 2 (4)a(D of) Foxe) ¥(000- ofoiy | * Lavo" = ’ Fon (D(o) - o(05)"| pO. A o() # 4 s(os) AXOy) AesA_ e(total) =( D(Or)- 0009) * C- ae Y= oe 7 b) Era = x oer (s(x) e dial (scos) # (4-3 groa(stoy)) = O(04) ¥U4- o(os) Hs (0(0s)) = O(04 4 (1-0(4)) Joa d gf) “a floc eos) ocr) +102] g - jf, (oots) #299) +55 4 A (cout) (Ys) z 4 £ (ocu)ans) tO+0 4c) « = O(Hy) Therefore <,gf etited « -((0(02) - o(os))KC! ) * a #(2- wi *0 Staflay am d mas total) = A ito . 4 o(03) a.) a ) ay > * Fog Sel O10)- cco) +8 aa “aol? #O(0)- oco))*| +4 +b \e#(o(o- oy Cs) * Ta ial) )¥(0(02)-0(03))") +0.Bee A ‘€ (total) = CO2)-+ O(02))* Ca) satt Lam | Io(0») , d_ o(0») =A. Legnoe (soy) “aste9 Teton (03)) + siqmoid (S04) 4(4- sigmoid (s = ofa) * (4-%) A O(0,) = O(Os) #(4-OC02)) a as(Os) shes 4 al ©2)) -Afe (+n) ® woe) +(OlH2)# we)+ wor] a (oc) * 4 we) Z A. (ousptes) tis vena Awe - flows we) +OtO dw x Atos) + = OCs) . a), ('002)- 003) 86) ee vdecte Je (orm (4-o¢oa))# OH). Similorly , / =A eCintal) = a, ECtokal)+ = Sto) feed dvs fictive!) - —_ asgee bea -o(o)))# o(4h) - milan ; drecas)- ((oto- o(oat ja lotenyr(\-0(03)) OU). | |Since bias weight, Why 7 both €(04) ard e(oy 4_ E(total) » total) +4 Wa og Jos a en) a - 00) 4 (420) aa t J 503) AS( 02) J 2000) « --pemeetoe = aule Hi) ¥ Ws +4 (oomaedegal) a A_(w o+0 +o 2) =A 50) = £. Similarly , Jy ocd) a. Therefore, Bette {eo- 0(04)) #(- )) 40 (o) - -otosacy] \(0D#E- o(os)+(0(os)4e- -oo))| #8."laden Layer 7 Opdation , Vo\1Q\a099 — 4) wt updation d 4 ectotal) «5 A ectotar eae otth) #2 sone), Toa ) sty) (oa a) A c (total A [eo] tae, fe] AocH 1) oat fe(ond= [4 i. 4 : y : gulls set) Ao!) ‘ft stooh” dolHs) = -[D(0s -olos)}* focos)ae- oO) ts similarly | i) (0s) = -[D@)- oto} [owos)e U- o(o2J] xe rerefore , A e(ietol) - f-[0(09 ocosp}t[ocos) 4 (4-010) watt docs) $-[o(od- -0( og} ¢ [OLOFE- o(osj) 3c} yA pow = A {amreneon) - symoid d(stayy AC -stqneis (609) © OCH )aCI- OCH) Hijo = OCH) *(1-OGH)A s(h) -A)Ge 9) + (Ta ¥ 03) + Wp, J 74 yd (a 4 nae Corte) od toy dg (ob)) -_4_ (5, €w1) 407° daw, A st) = te: » AW) i Therefore, ecto) 1? w) go a goles % (1-oC# Similarly» _d_(ectotal)) » t- [n(o.) - o(os)} [oxo t-ccoi) eo)? qtr Geep-costecon eo fot) + (-ocus)pe beh A (ectotal)) {D6 y-o(osyafowrsys (s-0)]4 vs} ad , -oop)t 2s" $ -[p(o»)- o(o2)| fotos) * C ( fot) * (1-04) yf se f-{0(01)-OH]} fora (-0(0N)}* os? §-b loa) - ole] #[ 0000) (-003))* J a ¢ OCH2) * (r-oca))t + {ta}. (os) -0(0.J}x[OC0s)4 o(0y) Jars oa) [exo (-CCog}4 web pga tes. ya tabias! weight , Obs fects both e(oy gene both (0 D4 e@,) ince 4 (ectotal) (i €(total)] +4 Gah funy “paged )+ fa OCH) 4 own) 4 ; ’ StH) ag) damon), from al the above calculate d Values, we can subst & Dn uUbsh- _4ute the above values as, A (octet) = -os))#[0Cos) 8 E- (es) & ws) 4 4(0(o2)* (4-0(0))) 4 “| : #(2-0(04) % wa) @ (4-0(0%)) rr) (-eo9 (-(0t0)-0(e2)) (( (D(04) - o(04))# (O19 (- (p(o2)- o(or))+ (Ot) # (ols) +004) xD I,Dekgring 4 Learning Sy Cus lero ta|ia| ana. Well at eat, teamtng problers_ td to team from expesience E uth p tasks T and pexfonnan, at tasks in T as h experience €« at preg rogram fs sa me class ° its. Performance improves colt awivirg car, pray gone, respect to SO! measure P, if measured by P? &: Speech recognition , eel P Classify tages . Designing a Learning System > cheosing the Training Experience -¥ Choosing the Target Function > Crevsing 0 epresentation for target function. 2 Choceing a Function Approximation Algorithm ; => Estimating Training values > Adjusting the ceights 2 Te Hal length. : Tasues in Machine Leasing > What leaming algorithms exist data ts sufficient. knooledge grnerabeing > Hew much raining > When and how Can prior leaner qide the process ot examples é at 3 pagel tor choosing useful next brouring © ae 7 to veduce leami bask to oF ox oo aisealinntiet problernc. ie —_— | held byte forel end Lharty. WRie tencasi 4 rl function: Onder Fitting Over Hitting 4oo much of less generalization, generaiization Concept Leasrfing * Definition Inferring a boolean -valued funetion Pro todin - Hs vp and 0/p- “04 examples oF # Concept: fe tN 243 # Tratining examples! ed a da [eee ° 1. ee pO O Ol4e oe eo 2 er RKaeog@rr ¢ © au ° 4 fe) £ oO A E, re Enjoy Sport fey & Concept -for predicting whether You ioe ey sport bused on the «weather a Ax Fratnlng Examples er — fore -| oy | - cast | Sport Eq. Sky Afs Tem ami wind Hate a. | Sunny | warm Normal | Strong warm Same| yes a. |sunng | warm | High Strong | warm) same) es | 3. | Reiny| cold | High | Strong] warm] change “nlo 4. Sunny warm High strong cool change| Nes A Concept Learning Task. + Genexal to Specific Ordering of Hepothesis + Genel Hypotbesis (2? Indicates ald values ave accepted y tndicates nd value is accepted * Corcept Lecesntn g as Search Concept Lecnning as Search (Find- 5 algorithm) ¥#FInd-S (Finding maximally specific hypothesis) % Start with be (o,6,0>¢, 6 4) then proceed with specificationconaidote Elirination Algortthm Bhia}aoag Find S algorithm returns a sfnal vjexet wh the trafning examples hypothesis con didate Elimination Algorithm returns set of of al consisten® hypothesis Uses version space uses more general than partial ordering. x Satishy Vs Consistent gatisly > Keyroore used in Consistent > keyword used Algortthen le x is Said to saticly hypothesis by when ba)= ether 1 is a positive negative t concept Find-s algosithm fo Candidate Elim nation $ Gomp 4, reqaadle 65 of whi example of the tage # Example 1 is consistent oth hip hUD= 69 \esion space HA set of all the bypothesis ig known as vapotte- “Sis space. | # The set of all the ngpothests conich ate cnet is Know as yersio? spare. with the traloing example a of Hypomnest SPT fe ¥ Neston Space is a subs! ve ’ - ae nests t eye spot ’ ’ ( 'EQOG Sport example t —" ore sky aie tunity Wind || water Fore — 4 | Sunng | Warm Normal | strong lwWarm Same | Yes | a. | Sunny | Warm High | Strong] Warm! same | Yes | | 3. | Rainy Cold High Strong Warm Change No, 4. | Sunny | Warm High strong | Cod Chang Yes, | % Output h<- Sunny , tlarm, 2 » Strong , 2 v f wv O[p by Find -S Algovthrm X Version space = Ip PY q {dsunoy, Warm, 2, Sbong,?, 2), <6unny Hae 2 Strong, 2), CSunny swarm, 2, 2,2,29,€2 wai, 2 Strong » 2, 225 {su 2.25% 52,2) » (2, Warm, 2,2 2225} ¥ Candidabe - Elirination Algorithm sepresents the set of all hypotheses that are consistent with the observ- ed taining examples using \lersion Space. ¥ DePinition [Constetent] + A Fnypothesis b is Consistent With a set of bral ning examples D tf and only y WO) = c(2) For each example (x, c(4)) tn O- Consistent (h.D) = (Vix, coo) € dD) hed) ect). * Definition (Verston Space] t The Version space ,Aencted NSy p12 rth respect +o hypothesis space H and Arainsng examples 0D, 's the subset of hypotheses from H consis ~tent with the taining examples in D.VSy,p 2 {h EH] Consistent Ch, DIY List - THEN - ELIMINATE Algonithn > step-4' IntHalize VSy,5 =4 example Foon D , aerd nate each training > step-at Fos found inconsistent and hypothesis > suttabie if H is finite Algorithm : 4, \lersion Space Uses. much more compact vrepresen Nersion Space- > Represents the version sp Boundary (C4) and Specific EnjoySport Exam pie using Step- 45 Tnitialize ac iLL Sa {49/9,0, 06:01 J Step-a: For each training example, S and G bourday ized and specialized, vespectively 4 ace using Genera Boundary S) z Candidate’ Blimination Algo: | j | Sets are gene ee—ESSsoQrKr ~ {$0,009.47 Strong» \Wasm, 6am ey} ‘ {cunt War m,Normal, my 24 Strong, » Warm, Garey} Sgt |{< sunny We Kuo erol Tiaining examples ¢ 4. CSunng, Warm, Normal , Strong » a, (Sunny, Warr, High » Strong, Warm ,Same > s Enjoy Sport = “ares: {4 i ‘Trainging €xamplet 3, KL warm, 2,22, 299 gy {furry 2,2,2,2,2> £U warm, 2,2, 2.2 22,2,2 Azra Training Example : 4. (Sunny, Warm, High Stsong : Coo1, Change, enjoy spost= Ves dy: |] €Sunny, roam, at Ds Cr warm, 29,2, 274 Gas Hf sunny, , he Gro) Mexslon Space Bor the ExeySpo* example Definition] General Boundary Qj: The 4 : a aves @, with wespect nq petres 5p Satin data 0, is the set of maximally general , 4 Mm a Fatt Embers of 4 Consistent with O- enexal boun- ce H and petalsG= (9 € H\ consistent (q,D) A(73q} € WE 4 a9) A consistent (q':0)} | ' Defiriition (Specific boundary $)¢ The Specific boindey S ,with vespect to hgpothesis space Hand ralning data D, is the Set oF Minimally general (\ fic.) Members of H Consistent with D @., Maxi - Malley spect S=45€H | Comictent (sv) aoase HIG > 5) * Consistent(s', >) Candidate - Elimination Leasing Algorithen: ~7 Thitialize G. to the set of maximaney qeresal Hypethests in H. ~ Inrtalize S$ to the set op maximaily Specific hypetheses onl = for each ‘Haining example a, do TF d is a positive example = Remove from G ang hypothesis Consistent with d. = for each hypothesis s fn S that is not coneistent with d @ Remove s from S © Add to S all mininal generaliza. -tions h of 6 such that —&b ‘'s consistent volth A ond Some Member of G5 more aeneval than h. ae Remove from S any hypothesis that ts more gener) +han another hypothesis hs. it disa negative example @ Remove Prom S any hypothesis Snconsistent uoith 4. e for each hypothes's 9 in G that fs roe Consistent with d > Remove 4 from G > Add to G all minimal specializations h of 9 such that —p> b is consistent with a and Some member of S is mose specific thao bh => Remove from G Any bypothes’s thet is less general than anches iypotne- “Sis in G Linear Models to Machine Learriing Linear Separability x Rare, ph~no, addr, ht, wt, bp, sugar, exercise_level , Calovies_ tntake & data +o check health condition Nomnral data > text data cotthout ang oxder Ordinal data -» text lata with order Numeric data + numloer data Story data + Binary valued data. AN olata ts converted fnto nurnbers & “%, \ heath » 6s, 0, 2,4,2) —> person's ke einen) ae‘2 , (3, 0) (18,0) Line plane Hyperplane > (6, peo 1,2) 4 = healthy person O- Unhealthy Person (6,65,0. 9112) oni ~o -4 -4 -o Ss\Mi Suppost Ntector machine