-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfindClosestCentroids.m
45 lines (34 loc) · 1.15 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
41
42
43
44
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);
% You need to return the following variables correctly.
idx = zeros(size(X,1), 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.
%
m=size(X,1);
for i=1:m
x=X(i,:);
dmin=10000.0;
for j=1:K
dx=x-centroids(j,:);
mu_j=sqrt(sum(dx.^2));
if mu_j < dmin
dmin=mu_j;
idx(i)=j;
end
end
end
% =============================================================
end