1 / 13

Regularization in Matrix Relevance Learning

Regularization in Matrix Relevance Learning. Petra Schneider, Kerstin Bunte , Han Stiekema , Barbara Hammer, Thomas Villmann , and Michael Biehl TNN, 2010 Presented by Hung-Yi Cai 2011/6/29. Outlines. Motivation Objectives Methodology Experiments Conclusions Comments. Motivation.

zorana
Télécharger la présentation

Regularization in Matrix Relevance Learning

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. Regularization in Matrix Relevance Learning Petra Schneider, Kerstin Bunte, Han Stiekema, Barbara Hammer, Thomas Villmann, and Michael Biehl TNN, 2010 Presented by Hung-Yi Cai 2011/6/29

  2. Outlines • Motivation • Objectives • Methodology • Experiments • Conclusions • Comments

  3. Motivation • Matrix learning tends to perform an overly strong feature selection which may have negative impact on the classification performance and the learning dynamics.

  4. Objectives To propose a regularization scheme for metric adaptation methods in LVQ to prevent the algorithms from oversimplifying the distance measure. The standard motivation for regularization is to prevent a learning system from overfitting.

  5. Methodology • Matrix Learning in LVQ • LVQ aims at parameterizing a distance-based classification scheme in terms of prototypes. • Learning aims at determining weight locations for the prototypes such that the given training data are mapped to their corresponding class labels.

  6. Methodology • Matrix Learning in GLVQ • Matrix learning in GLVQ is derived as a minimization of the cost function

  7. Methodology • Regularized cost function • The approach can easily be applied to any LVQ algorithm with an underlying cost function . • In case of GMLVQ, the extended cost function… • The update rule for the metric parameters…

  8. Experiments Artificial Data

  9. Experiments • Real-Life Data • Pima Indians Diabetes

  10. Experiments • Real-Life Data • Glass Identification

  11. Experiments • Real-Life Data • Letter Recognition

  12. Conclusions • The proposed regularization scheme prevents oversimplification, eliminates instabilities in the learning dynamics, and improves the generalization ability of the considered metric adaptation algorithms. • The new method turns out to be advantageous to derive discriminative visualizationsby means of GMLVQ with a rectangular matrix.

  13. Comments • Advantages • Improving the VQ in the ANN. • Drawbacks • It’s very difficult to understand. • Applications • Learning Vector Quantization

More Related