-
Notifications
You must be signed in to change notification settings - Fork 1
/
findClosestCentroids.m
41 lines (33 loc) · 1.14 KB
/
findClosestCentroids.m
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
function idx = findClosestCentroids(X, centroids)
%FINDCLOSESTCENTROIDS computes the centroid memberships for every example
% idx = FINDCLOSESTCENTROIDS (X, centroids) returns the closest centroids
% in idx for a dataset X where each row is a single example. idx = m x 1
% vector of centroid assignments (i.e. each entry in range [1..K])
%
% Set K
K = size(centroids, 1);
m=size(X,1);
% You need to return the following variables correctly.
idx = zeros(m, 1);
% ====================== YOUR CODE HERE ======================
% Instructions: Go over every example, find its closest centroid, and store
% the index inside idx at the appropriate location.
% Concretely, idx(i) should contain the index of the centroid
% closest to example i. Hence, it should be a value in the
% range 1..K
%
% Note: You can use a for-loop over the examples to compute this.
%
%{
for i=1:m
p=sum(abs(X(i,:)-centroids),2)
temp=find(p==min(p))
idx(i,1)=temp(1)
endfor
%}
for i=1:m
p=sqrt(sum(power(centroids-X(i,:),2),2));
[val,idx(i)]=min(p);
endfor
% =============================================================
end