Locally Linear Embedding (LLE) Homepage

(Notes, e.g. [a] appear below) Input X: D by N matrix consisting of N data items in D dimensions. Output Y: d by N matrix consisting of d < D dimensional embedding coordinates for the input points. Find neighbours in X space [b,c]. for i=1:N compute the distance from Xi to every other point Xj find the K smallest distances assign the corresponding points to be neighbours of Xi end Solve for recons

[tettsyun]

LLE