% SLLE ALGORITHM (using K nearest neighbors)
%
% [Y] = lle(X,K,dmax,a)
%
% X = data as D x N matrix (D = dimensionality, N = #points)
% K = number of neighbors
% dmax = max embedding dimensionality
% Y = embedding as dmax x N matrix
% a=增量因子
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
function [Y] = lle(X,K,d,a)
[D,N] = size(X);
fprintf(1,'SLLE running on %d points in %d dimensions\n',N,D);
% STEP1: COMPUTE PAIRWISE DISTANCES & FIND NEIGHBORS
fprintf(1,'-->Finding %d nearest neighbours.\n',K);
X2 = sum(X.^2,1);
distance = repmat(X2,N,1)+repmat(X2',1,N)-2*X'*X;
B=ones(N);
R=N/(d+1);
for i=1:d+1;
B(1+R*(i-1):R*i,1+R*(i-1):R*i)=zeros(R);
end;
distance1=distance+a*max(max(distance))*B;
[sorted,index] = sort(di
监督局部线性嵌入算法(SLLE算法)
最新推荐文章于 2019-09-14 12:24:30 发布
本文深入探讨了监督局部线性嵌入(SLLE)算法,这是一种在机器学习中用于高维数据降维的方法。SLLE旨在保留数据的局部结构,并在低维空间中保持原有的邻近关系。文章详细介绍了算法原理、实现步骤以及其在实际应用中的优势。
摘要由CSDN通过智能技术生成