Manifold%20learning - PowerPoint PPT Presentation

About This Presentation
Title:

Manifold%20learning

Description:

Manifold learning Xin Yang Outline Manifold and Manifold Learning Classical Dimensionality Reduction Semi-Supervised Nonlinear Dimensionality Reduction Experiment ... – PowerPoint PPT presentation

Number of Views:170
Avg rating:3.0/5.0
Slides: 30
Provided by: xiny152
Learn more at: https://www.cse.psu.edu
Category:

less

Transcript and Presenter's Notes

Title: Manifold%20learning


1
Manifold learning
  • Xin Yang

2
Outline
  • Manifold and Manifold Learning
  • Classical Dimensionality Reduction
  • Semi-Supervised Nonlinear Dimensionality
    Reduction
  • Experiment Results
  • Conclusions

3
What is a manifold?
4
Examples sphere and torus
5
Why we need manifold?
6
(No Transcript)
7
Manifold learning
  • Raw format of natural data is often high
    dimensional, but in many cases it is the outcome
    of some process involving only few degrees of
    freedom.

8
Manifold learning
  • Intrinsic Dimensionality Estimation
  • Dimensionality Reduction

9
Dimensionality Reduction
  • Classical Method
  • Linear MDS PCA (Hastie 2001)
  • Nonlinear LLE (Roweis Saul, 2000) ,
  • ISOMAP (Tenebaum 2000),
  • LTSA (Zhang Zha 2004)
  • -- in general, low dimensional coordinates lack
    physical meaning

10
Semi-supervised NDR
  • Prior information
  • Can be obtained from experts or by performing
    experiments
  • Eg moving object tracking

11
Semi-supervised NDR
  • Assumption
  • Assuming the prior information has a physical
    meaning, then the global low dimensional
    coordinates bear the same physical meaning.

12
Basic LLE
13
Basic LTSA
  • Characterized the geometry by computing an
    approximate tangent space

14
SS-LLE SS-LTSA
  • Give m the exact mapping data points .
  • Partition Y as
  • Our problem

15
SS-LLE SS-LTSA
  • To solve this minimization problem, partition M
    as
  • Then the minimization problem can be written as

16
SS-LLE SS-LTSA
  • Or equivalently
  • Solve it by setting its gradient to be zero, we
    get

17
Sensitivity Analysis
  • With the increase of prior points, the condition
    number of the coefficient matrix gets smaller and
    smaller, the computed solution gets less
    sensitive to the noise in and

18
Sensitivity Analysis
  • The sensitivity of the solution depends on the
    condition number of the matrix

19
Inexact Prior Information
  • Add a regularization term, weighted with a
    parameter

20
Inexact Prior Information
  • Its minimizer can be computed by solving the
    following linear system

21
Experiment Results
  • incomplete tire
  • --compare with basic LLE and LTSA
  • --test on different number of prior points
  • Up body tracking
  • --use SSLTSA
  • --test on inexact prior information algorithm

22
Incomplete Tire
23
(No Transcript)
24
Relative error with different number of prior
points
25
Up body tracking
26
Results of SSLTSA
27
Results of inexact prior information algorithm
28
Conclusions
  • Manifold and manifold learning
  • Semi-supervised manifold learning
  • Future work

29
Thank you !
Write a Comment
User Comments (0)
About PowerShow.com