1 / 46

Advanced Mathematics

Advanced Mathematics. Hossein Malekinezhad. Visual Object Recognition. FACE DETECTION. Final Exam: 50% Homework: 15% Research Work: 35%. WWW.MALEKINEZHAD.IR. K-Nearest Neighbor Learning. Different Learning Methods. Eager Learning

amish
Download Presentation

Advanced Mathematics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Advanced Mathematics Hossein Malekinezhad

  2. Visual Object Recognition

  3. FACE DETECTION

  4. Final Exam: 50% Homework: 15% Research Work: 35%

  5. WWW.MALEKINEZHAD.IR

  6. K-Nearest Neighbor Learning

  7. Different Learning Methods • Eager Learning • Explicit description of target function on the whole training set • Instance-based Learning • Learning=storing all training instances • Classification=assigning target function to a new instance • Referred to as “Lazy” learning

  8. Different Learning Methods • Eager Learning Any random movement =>It’s a mouse I saw a mouse!

  9. Instance-based Learning Its very similar to a Desktop!!

  10. Instance-based Learning • K-Nearest Neighbor Algorithm • Weighted Regression • Case-based reasoning

  11. K-Nearest Neighbor • Features • All instances correspond to points in an n-dimensional Euclidean space • Classification is delayed till a new instance arrives • Classification done by comparing feature vectors of the different points • Target function may be discrete or real-valued

  12. 1-Nearest Neighbor

  13. 3-Nearest Neighbor

  14. K-Nearest Neighbor • An arbitrary instance is represented by • (a1(x), a2(x), a3(x),.., an(x)) • ai(x) denotes features • Euclidean distance between two instances d(xi, xj)=sqrt (sum for r=1 to n (ar(xi) - ar(xj))2) • Continuous valued target function • mean value of the k nearest training examples

More Related