1 / 10

M.S. Student, Daewon Ko 07. 22. 2014

Introduction to LMNN and progress review . M.S. Student, Daewon Ko 07. 22. 2014. Contents. Definition of LMNN Schematic illustration of LMNN Algorithm of LMNN Current progress review of my research. Definition of LMNN. Large margin nearest neighbor(LMNN) classification

saxton
Télécharger la présentation

M.S. Student, Daewon Ko 07. 22. 2014

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. Introduction to LMNN and progress review M.S. Student, DaewonKo 07. 22. 2014

  2. Contents • Definition of LMNN • Schematic illustration of LMNN • Algorithm of LMNN • Current progress review of my research

  3. Definition of LMNN • Large margin nearest neighbor(LMNN) classification : 1) a statistical machine learning algorithm. 2) it learns a Pseudo metric designed for k-nearest neighbor classification.

  4. Definition of LMNN • Notation 1) Traing data 2) Set of possible class • Objective Leaning a pseudo metric of the type

  5. Schematic illustration of LMNN Euclidean Metric Mahalanobis Metric Local neighborhood M Margin Similarly labeled(target neighbor) Differently labeled(impostor) Differently labeled(impostor)

  6. Algorithm of LMNN LMNN optimizes the matrix M by semidefinte programming. For every data point , the target neighbors should be close and the impostors should be far away.

  7. Algorithm of LMNN • The first optimization goal : minimizing the average distance between instances and their target neighbors • The second goal : constraining impostors to be one unit further away than target neighbors their resulting inequality constraint can be stated as:

  8. Algorithm of LMNN • The final optimization becomes: s.t.

  9. Progress of my research

  10. Progress of my research

More Related