Ng机器学习 Week8 Unsupervised Learning

Clustering

Q1&Q2
Q3&Q4
Q5

Principal Component Analysis

Q1
Q2&Q3 Q2选2。。。手滑
Q4&Q5

Quiz

findClosestCentroids.m

temp = zeros(K,1); 
for i = 1:size(X,1)
    for j = 1:K
        temp(j) = sum((X(i,:) - centroids(j,:)).^2); 
    end
   [value,idx(i)] = min(temp,[],1); 
end 

computeCentroids.m

for i = 1:K
    centroids(i,:) = (X' * (idx == i)) / sum(idx == i);   %X' * (idx == i)  To add x in same center 
end 

kMeansInitCentroids.m

% Randomly reorder the indices of examples
randidx = randperm(size(X, 1));
% Take the first K examples as centroids
centroids = X(randidx(1:K), :);

pca.m

sigma = X' * X / m;     % compute the covariance matrix
[U,S,V] = svd(sigma);   % SVD

projectData.m

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

recoverData.m

X_rec = Z * U(:,1:K)'; 
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值