lle算法详解及matlab代码实现.docVIP

LLE相关知识详解网址：/p-196479604.html LLE在其它参考文献中讲解的实现方式，结合上述方法，更能理解lle的本质 LLE算法代码 % LLE ALGORITHM (using K nearest neighbors) % % [Y] = lle(X,K,dmax) % % X = data as D x N matrix (D = dimensionality, N = #points) %(D = 点的维数, N = 点数) % K = number of neighbors(领域点的个数) % dmax = max embedding dimensionality(最大嵌入维数) % Y = embedding as dmax x N matrix %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% function [Y] = lle(X,K,d) [D,N] = size(X); %D是矩阵的行数，N是矩阵的列数 fprintf(1,LLE running on %d points in %d dimensions\n,N,D); % STEP1: COMPUTE PAIRWISE DISTANCES FIND NEIGHBORS %寻找邻居数据点 fprintf(1,--Find