I t i F Isometric Fea

(ISOM (ISOM
K Ch Ke Ch
COMP61021 Modelling and Vis
t M i ature Mapping
MAP) MAP)
hhen
ualization of High Dimensional Data
Out Out
I t d ti Introduction
Basics of Non Euclidian Basics of Non-Euclidian
ISOMAP Algorithm ISOMAP Algorithm
Examples p
Case Study: PCA vs. LD
Relevant Issues
Conclusions
COMP61021 Modelling and Visua
tline tline
n Space n Space
DA
alization of High Dimensional Data
2
Introdu Introdu
COMP61021 Modelling and Visua
uction uction
alization of High Dimensional Data
3
Introdu Introdu
Isometric feature mapping ( Isometric feature mapping (
A state-of-the-art non-linear
structure appearing in a high structure appearing in a high
In ISOMAP, a geodesic distan
Useful for recovering a low d
COMP61021 Modelling and Visua
uction uction
(ISOMAP) (ISOMAP)
MDS method for modelling manifold
h dimensional space h dimensional space
nce metric is employed.
imensional isometric embedding
alization of High Dimensional Data
4
Basics of Non- Basics of Non
COMP61021 Modelling and Visua
Euclidian Space Euclidian Space
alization of High Dimensional Data
5
Basics of Non- Basics of Non
COMP61021 Modelling and Visua
Euclidian Space Euclidian Space
alization of High Dimensional Data
6
Basics of Non- Basics of Non
COMP61021 Modelling and Visua
Euclidian Space Euclidian Space
alization of High Dimensional Data
7
Basics of Non- Basics of Non
COMP61021 Modelling and Visua
Euclidian Space Euclidian Space
alization of High Dimensional Data
8
Basics of Non- Basics of Non
COMP61021 Modelling and Visua
Euclidian Space Euclidian Space
alization of High Dimensional Data
9
Basics of Non- Basics of Non
COMP61021 Modelling and Visua
Euclidian Space Euclidian Space
alization of High Dimensional Data
10
ISOMAP A ISOMAP A
MDS slides
COMP61021 Modelling and Visua
Algorithm Algorithm
alization of High Dimensional Data
11
ISOMAP A ISOMAP A
COMP61021 Modelling and Visua
Algorithm Algorithm
alization of High Dimensional Data
12
ISOMAP A ISOMAP A
COMP61021 Modelling and Visua
Algorithm Algorithm
alization of High Dimensional Data
13
ISOMAP A ISOMAP A
D
) (S) (S
COMP61021 Modelling and Visua
Algorithm Algorithm
Dijkstras Algorithm
alization of High Dimensional Data
14
ISOMAP A ISOMAP A
COMP61021 Modelling and Visua
Algorithm Algorithm
alization of High Dimensional Data
15
Exam Exam
COMP61021 Modelling and Visua
mples mples
alization of High Dimensional Data
16
Exam Exam
COMP61021 Modelling and Visua
mples mples
alization of High Dimensional Data
17
Exam Exam
COMP61021 Modelling and Visua
mples mples
alization of High Dimensional Data
18
Relevan Relevan
COMP61021 Modelling and Visua
nt Issues nt Issues
alization of High Dimensional Data
19
Conclus Conclus
ISOMAP is a nonlinear MDS met ISOMAP is a nonlinear MDS met
in a low dimensional space via m
It has three steps: a) construct a It has three steps: a) construct a
shortest path and c) construct lo
ISOMAP can fail in its two main
Geodesic Approximation
Points need to be sampled unif
The intrinsic parameter space
MDS
There might not exist an isome
Suffer from a high computationa
There are several extensions to
COMP61021 Modelling and Visua
sions sions
hod to recovering intrinsic manifold hod to recovering intrinsic manifold
minimum distortion embedding.
a neighbourhood graph b) compute a neighbourhood graph, b) compute
ow-dimensional embedding.
steps:
formly (densely) from a noiseless manifold.
must be convex.
etric embedding (or anything close to one)
al cost and sensitive to noise.
overcome those problems.
alization of High Dimensional Data
20