By Jamie Long,2014-02-14 13:58
19 views 0
LLE Algorithm Pseudocode (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. 1. Find neighbours in X space [b,c]. 2. for i=1:N 3. compute the distance from Xi to every other point Xj 4. find the K smallest dis..

Report this document

For any questions or suggestions please email