CCA Algorithm
,Given a data set I of dimension M, CCA projects I to
data set O of dimension S where S<M and preserves in the output set O the distances between
all the data points in I
: a bounded and
monotonically
decreasing function, e.g., exponential, etc
NxN
Nx2
Distance
Matrix
Node
Coordinates
X11
X1N
XN1
XNN
y11
y12
yN1
yN2
x11
x1M
xN1
xNM
,
Input Data
Set
…
…
Minimizing
cost function:
By
updating in each cycle: