您的位置:首页 > 其它

Stanford 机器学习 Week8 作业:K-means Clustering and Principal Component Analysis

2016-03-20 23:22 423 查看
FindClosestCentroids

for i = 1:size(X,1)
dis = sum((centroids - X(i,:)) .^ 2, 2);
[t, idx(i)] = min(dis);
end


ComputeCentroids

for i = 1:K
id = find(idx == i);
tot = X(id,:);
centroids(i,:) = mean(tot);
end


RandomInitialization

id = randperm(size(X,1));
id = id(1:K);
centroids = X(id);


PCA

sigma = 1/m * X' * X;
[U,S,V] = svd(sigma);


ProjectionData(PCA)

Z = X * U(:,1:K);


RecoverData(PCA)

X_rec = Z * U(:,1:K)'
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  机器学习 octave