130 likes | 237 Views
The Elastic Embedding Algorithm for Dimensionality Reduction. Presenter : Wei- Hao Huang Authors : Miguel ´ A. Carreira-Perpi˜ n´an ICML , 2010. Outlines. Motivation Objectives Methodology Experiments Conclusions Comments. Motivation.
E N D
The Elastic Embedding Algorithm for Dimensionality Reduction Presenter : Wei-Hao HuangAuthors : Miguel ´ A. Carreira-Perpi˜n´anICML, 2010
Outlines • Motivation • Objectives • Methodology • Experiments • Conclusions • Comments
Motivation • The disadvantage of dimensionality reduction • Difficult to understand their objective function. • Optimisationis costly and prone to local optima.
Objectives • To propose a new dimensionality reduction • More efficient and robust • Further our understanding algorithms
Methodology - Framework Objective function + Laplacianeigenmaps SNE High dimension dataset Elastic Embedding Low dimension data
Methodology – Elastic Embedding • Object function • Gradient of E
Methodology - Study of λ • N=2 • N>2
Methodology – Out of sample • Objective function • Mapping and reconstruction mappings
Conclusions • EE dimensionality reduction improves over SNE methods. • EE produces better quality more quickly and robustly. • All of ideas can be directly applied to SNE, t-SNE and earlier algorithms.
Comments • Advantages • EE improves disadvantage of SNE on different versions • Applications • Dimensionality Reduction